Paper Info
Title
The Domination Complexity and Related Extremal Values of Large 3D Torus.
Abstract
Domination is a structural complexity of chemical molecular graphs. A dominating set in a (molecular) graph G = (V, E) is a subset S subset of V such that each vertex in V \ S is adjacent to at least one vertex in S. The domination number gamma(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.
Year
DOI
Venue
2018
10.1155/2018/3041426
COMPLEXITY
Field
DocType
Volume
Graph,Dominating set,Combinatorics,Vertex (geometry),Structural complexity,Control theory,Torus,Domination analysis,Mathematics
Journal
2018
ISSN
Citations 
PageRank 
1076-2787
0
0.34
References 
Authors
11
4
Name
Order
Citations
PageRank
Zehui Shao111930.98
Jin Xu223045.13
S.M. Sheikholeslami37114.63
Shao-hui Wang412619.62