The Domination Complexity and Related Extremal Values of Large 3D Torus
Joint Authors
Shao, Zehui
Xu, Jin
Sheikholeslami, S. M.
Wang, Shaohui
Source
Issue
Vol. 2018, Issue 2018 (31 Dec. 2018), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2018-07-02
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract EN
Domination is a structural complexity of chemical molecular graphs.
A dominating set in a (molecular) graph G=V,E is a subset S⊆V such that each vertex in V\S is adjacent to at least one vertex in S.
The domination number γG of a graph G is the minimum size of a dominating set in G.
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.
American Psychological Association (APA)
Shao, Zehui& Xu, Jin& Sheikholeslami, S. M.& Wang, Shaohui. 2018. The Domination Complexity and Related Extremal Values of Large 3D Torus. Complexity،Vol. 2018, no. 2018, pp.1-8.
https://search.emarefa.net/detail/BIM-1133483
Modern Language Association (MLA)
Shao, Zehui…[et al.]. The Domination Complexity and Related Extremal Values of Large 3D Torus. Complexity No. 2018 (2018), pp.1-8.
https://search.emarefa.net/detail/BIM-1133483
American Medical Association (AMA)
Shao, Zehui& Xu, Jin& Sheikholeslami, S. M.& Wang, Shaohui. The Domination Complexity and Related Extremal Values of Large 3D Torus. Complexity. 2018. Vol. 2018, no. 2018, pp.1-8.
https://search.emarefa.net/detail/BIM-1133483
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1133483
