Upper Bounds for the Domination Number of a Kind of Hamiltonian Graphs

Let G=(V,E) be a simple graph.A subset DV is a dominating set of G,if for any vertex u∈V-D,there exists a vertex u∈D such that uv∈E.The domination number of G equals the minimum cardinality of a domination set.In this paper,we will research the domination number of hamiltonian graphs and prove that for a hamiltonian graph G of order n with minimun degree at least five,the domination munber of is at most 5n/14.