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

来源：

APPLIED MATHEMATICS LETTERS | 2008年 / 21卷 / 10期

关键词：

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 条

[21] Paired domination versus domination and packing number in graphs
Magda Dettlaff
Didem Gözüpek
Joanna Raczek
Journal of Combinatorial Optimization, 2022, 44 : 921 - 933
[22] DOMINATION GAME: A PROOF OF THE 3/5-CONJECTURE FOR GRAPHS WITH MINIMUM DEGREE AT LEAST TWO
Henning, Michael A.
Kinnersley, William B.
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (01) : 20 - 35
[23] The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number
Dankelmann, Peter
Morgan, Jane
Rivett-Carnac, Emily
GRAPHS AND COMBINATORICS, 2024, 40 (01)
[24] The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number
Peter Dankelmann
Jane Morgan
Emily Rivett-Carnac
Graphs and Combinatorics, 2024, 40
[25] Graphs with Large Italian Domination Number
Teresa W. Haynes
Michael A. Henning
Lutz Volkmann
Bulletin of the Malaysian Mathematical Sciences Society, 2020, 43 : 4273 - 4287
[26] On the Secure Total Domination Number of Graphs
Cabrera Martinez, Abel
Montejano, Luis P.
Rodriguez-Velazquez, Juan A.
SYMMETRY-BASEL, 2019, 11 (09):
[27] On the strong Roman domination number of graphs
Alvarez-Ruiz, M. P.
Mediavilla-Gradolph, T.
Sheikholeslami, S. M.
Valenzuela-Tripodoro, J. C.
Yero, I. G.
DISCRETE APPLIED MATHEMATICS, 2017, 231 : 44 - 59
[28] Graphs with Large Italian Domination Number
Haynes, Teresa W.
Henning, Michael A.
Volkmann, Lutz
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2020, 43 (06) : 4273 - 4287
[29] A note on the independent domination number in graphs
Rad, Nader Jafari
Volkmann, Lutz
DISCRETE APPLIED MATHEMATICS, 2013, 161 (18) : 3087 - 3089
[30] On the distance domination number of bipartite graphs
Mojdeh, Doost Ali
Musawi, Seyed Reza
Kiashi, Esmaeil Nazari
ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2020, 8 (02) : 353 - 364

← 1 2 3 4 5 →