The Domination Complexity and Related Extremal Values of Large 3D Torus-Reference-Cited by-同舟云学术

The Domination Complexity and Related Extremal Values of Large 3D Torus

Published:2018-07-02 Issue: Volume:2018 Page:1-8
ISSN:1076-2787
Container-title:Complexity
language:en
Short-container-title:Complexity

Author:

Shao Zehui¹^ORCID,Xu Jin¹,Sheikholeslami S. M.²,Wang Shaohui³^ORCID

Affiliation:

1. Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China

2. Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran

3. Department of Mathematics, Savannah State University, Savannah, GA 31404, USA

Abstract

Domination is a structural complexity of chemical molecular graphs. A dominating set in a (molecular) graphG=V,Eis a subsetS⊆Vsuch that each vertex inV\Sis adjacent to at least one vertex inS. The domination numberγGof a graphGis the minimum size of a dominating set inG. In this paper, computer-aided approaches for obtaining bounds for domination number on torus graphs are here considered, and many new exact values and bounds are obtained.

Funder

Applied Basic Research (Key Project) of Sichuan Province

Publisher

Hindawi Limited

Subject

Multidisciplinary,General Computer Science

Link

http://downloads.hindawi.com/journals/complexity/2018/3041426.pdf

Reference25 articles.

1. Bibliography on domination in graphs and some basic definitions of domination parameters

2. Valency-based topological descriptors of chemical networks and their applications

3. A note on the independent domination number versus the domination number in bipartite graphs

4. On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. More Results on the Domination Number of Cartesian Product of Two Directed Cycles;Mathematics;2019-02-24

2. The Double Roman Domination Numbers of Generalized Petersen Graphs P(n, 2);Mathematics;2018-10-16

3. Hamilton-connectivity of Interconnection Networks Modeled by a Product of Graphs;Applied Mathematics and Nonlinear Sciences;2018-07-01

4. Computational Complexity of Outer-Independent Total and Total Roman Domination Numbers in Trees;IEEE Access;2018