2 search results - page 1 / 1 » Upper minus domination in a claw-free cubic graph |
DM
2006
14 years 10 months ago
2006
101
click to vote
GC
2008
Springer
14 years 10 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...