92 search results - page 2 / 19 » Bottleneck Domination and Bottleneck Independent Domination ... |
91
Voted
DM
2006
15 years 13 days 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...
130
click to vote
FCS
2009
14 years 10 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. ...
101
Voted
JGT
2007
15 years 9 days 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...
88
Voted
ISAAC
1993
Springer
15 years 4 months ago
1993
Springer
94
Voted
CPC
2006
15 years 13 days ago
2006