92 search results - page 2 / 19 » Bottleneck Domination and Bottleneck Independent Domination ... |
DM
2006
13 years 7 months ago
2006
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
FCS
2009
13 years 5 months ago
2009
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...
JGT
2007
13 years 7 months ago
2007
A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove that there are no r-regular uniquely hamiltonian graphs when r > 22. This im...
ISAAC
1993
Springer
13 years 11 months ago
1993
Springer
CPC
2006
13 years 7 months ago
2006