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

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

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, c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Complexity (New York, N.Y.) N.Y.), 2018-01, Vol.2018 (2018), p.1-8
Hauptverfasser: Wang, Shaohui, Sheikholeslami, S. M., Xu, Jin, Shao, Zehui
Format: Artikel
Sprache:eng
Schlagworte:
Applied mathematics
Coding theory
Combinatorics
Complexity
Graphs
Linear programming
Molecular chains
Organic chemistry
Toruses
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1076-2787
1099-0526
DOI:10.1155/2018/3041426