103 search results - page 1 / 21 » A New Upper Bound on the Total Domination Number of a Graph |
COMBINATORICS
2007
13 years 5 months ago
2007
DM
2008
13 years 5 months ago
2008
In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any ...
EJC
2008
13 years 5 months ago
2008
COMBINATORICS
2006
13 years 5 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
DM
2006
13 years 5 months ago
2006
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a fac...