On the domination number of Hamiltonian graphs with minimum degree six

被引:0
|
作者
Xing, Hua-Ming [1 ,2 ]
Hattingh, Johannes H. [3 ]
Plummer, Andrew R. [3 ]
机构
[1] Tianjin Univ Sci & Technol, Sch Sci, Tianjin 300457, Peoples R China
[2] Langfang Normal Coll, Dept Math, Langfang 065000, Hebei, Peoples R China
[3] Georgia State Univ, Dept Math & Stat, Atlanta, GA 30303 USA
关键词
domination; Hamiltonian graph; degree six;
D O I
10.1016/j.aml.2007.10.023
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let G = (V, E) be a simple graph. A set D subset of V is a dominating set of G if every vertex of V - D is adjacent to a vertex of D. The domination number of G, denoted by gamma(G), is the mini mum cardinality of a dominating set of G. We prove that if G is a Hamiltonian graph of order n with mini mum degree at least six, then gamma(G) <= 6n/17. (C) Elsevier Ltd. All rights reserved.
引用
收藏
页码:1037 / 1040
页数:4
相关论文
共 50 条
  • [41] Extremal connected graphs for independent domination number
    Brigham, RC
    Carrington, JR
    Vitray, RP
    DISCRETE MATHEMATICS, 2004, 275 (1-3) : 299 - 309
  • [42] Disjunctive Total Domination Subdivision Number of Graphs
    Ciftci, Canan
    Aytac, Vecdi
    FUNDAMENTA INFORMATICAE, 2020, 174 (01) : 15 - 26
  • [43] The Regular Domination Number of Some Special Graphs
    Rani, Jyoti
    Mehra, Seema
    COMMUNICATIONS IN MATHEMATICS AND APPLICATIONS, 2024, 15 (01): : 161 - 178
  • [44] Bounds of the 2-domination number of graphs
    Blidia, Mostafa
    Chellali, Mustapha
    Volkmann, Lutz
    UTILITAS MATHEMATICA, 2006, 71 : 209 - 216
  • [45] Characterization of Unicyclic Graphs with equal 2-Domination Number and Domination Number plus one
    Hansberg, Adriana
    Volkmann, Lutz
    UTILITAS MATHEMATICA, 2008, 77 : 265 - 276
  • [46] On domination and 2-degree-packing numbers in graphs
    Vazquez-Avila, Adrian
    RAIRO-OPERATIONS RESEARCH, 2024, 58 (01) : 1005 - 1010
  • [47] [1, k]-Domination Number of Lexicographic Products of Graphs
    Ghareghani, Narges
    Peterin, Iztok
    Sharifani, Pouyeh
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2021, 44 (01) : 375 - 392
  • [48] A NEW BOUND ON THE DOMINATION NUMBER OF CONNECTED CUBIC GRAPHS
    Kostochka, A., V
    Stocker, C.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2009, 6 : 465 - 504
  • [49] [1, k]-Domination Number of Lexicographic Products of Graphs
    Narges Ghareghani
    Iztok Peterin
    Pouyeh Sharifani
    Bulletin of the Malaysian Mathematical Sciences Society, 2021, 44 : 375 - 392
  • [50] The clique number and some Hamiltonian properties of graphs
    Li, Rao
    CONTRIBUTIONS TO MATHEMATICS, 2021, 4 : 20 - 22