Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9513004 | Discrete Mathematics | 2005 | 6 Pages |
Abstract
In 1996, Reed proved that the domination number γ(G) of every n-vertex graph G with minimum degree at least 3 is at most 3n/8. Also, he conjectured that γ(H)⩽ân/3â for every connected 3-regular (cubic) n-vertex graph H. In this note, we disprove this conjecture. We construct a connected cubic graph G on 60 vertices with γ(G)=21 and present a sequence {Gk}k=1â of connected cubic graphs withlimkââγ(Gk)|V(Gk)|⩾823=13+169.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
A.V. Kostochka, B.Y. Stodolsky,