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

Zehui Shao, Jin Xu, S. M. Sheikholeslami and Shaohui Wang

Complexity, 2018, vol. 2018, 1-8

Abstract:

Domination is a structural complexity of chemical molecular graphs. A dominating set in a (molecular) graph is a subset such that each vertex in is adjacent to at least one vertex in . The domination number of a graph is the minimum size of a dominating set in . 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.

Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2018/3041426.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2018/3041426.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:3041426

DOI: 10.1155/2018/3041426

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().