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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-Wiley
2018-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2018/3041426 |
| Summary: | 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 |