Keerti Choudhary

activity

20112026

most citedDynamic DFS Tree in Undirected Graphs: breaking the

O (m)

barrier

14 citations · 19 across the 13 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2012

A Note on Integer Domination of Cartesian Product Graphs

K. Choudhary, S. Margulies, I. V. Hicks

Given a graph $G$ , a dominating set $D$ is a set of vertices such that any vertex in $G$ has at least one neighbor (or possibly itself) in $D$ . A $k$ -dominating multiset $D_{k}$ is…

math.CO2011

A Note on Total and Paired Domination of Cartesian Product Graphs

K. Choudhary, S. Margulies, I. V. Hicks

A dominating set $D$ for a graph $G$ is a subset of $V (G)$ such that any vertex not in $D$ has at least one neighbor in $D$ . The domination number $γ (G)$ is the size of a minimum d…