Location of Repository

The domination number of cubic Hamiltonian graphs

By 

Abstract

A.J.W. Hilton 1 and A. Kostochka 2 Let γ(G) denote the domination number of a graph, and let C be the set of all Hamiltonian cubic graphs. Let and ¯γ(n) = max {γ(G) | G ∈ C and |V (G) | = n}, γ(n) = min {γ(G) | G ∈ C and |V (G) | = n}. Then, for n ≥ 4, n even, n +

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.189.5401
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.reading.ac.uk/%7Esm... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.