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

Full description

Bibliographic Details
Main Authors: Zehui Shao, Jin Xu, S. M. Sheikholeslami, Shaohui Wang
Format: Article
Language:English
Published: Hindawi-Wiley 2018-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2018/3041426
id doaj-0b5c81cb87db4c65b2574a449cb99371
record_format Article
spelling doaj-0b5c81cb87db4c65b2574a449cb993712020-11-25T01:55:59ZengHindawi-WileyComplexity1076-27871099-05262018-01-01201810.1155/2018/30414263041426The Domination Complexity and Related Extremal Values of Large 3D TorusZehui Shao0Jin Xu1S. M. Sheikholeslami2Shaohui Wang3Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, ChinaInstitute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, ChinaDepartment of Mathematics, Azarbaijan Shahid Madani University, Tabriz, IranDepartment of Mathematics, Savannah State University, Savannah, GA 31404, USADomination 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.http://dx.doi.org/10.1155/2018/3041426
collection DOAJ
language English
format Article
sources DOAJ
author Zehui Shao
Jin Xu
S. M. Sheikholeslami
Shaohui Wang
spellingShingle Zehui Shao
Jin Xu
S. M. Sheikholeslami
Shaohui Wang
The Domination Complexity and Related Extremal Values of Large 3D Torus
Complexity
author_facet Zehui Shao
Jin Xu
S. M. Sheikholeslami
Shaohui Wang
author_sort Zehui Shao
title The Domination Complexity and Related Extremal Values of Large 3D Torus
title_short The Domination Complexity and Related Extremal Values of Large 3D Torus
title_full The Domination Complexity and Related Extremal Values of Large 3D Torus
title_fullStr The Domination Complexity and Related Extremal Values of Large 3D Torus
title_full_unstemmed The Domination Complexity and Related Extremal Values of Large 3D Torus
title_sort domination complexity and related extremal values of large 3d torus
publisher Hindawi-Wiley
series Complexity
issn 1076-2787
1099-0526
publishDate 2018-01-01
description 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.
url http://dx.doi.org/10.1155/2018/3041426
work_keys_str_mv AT zehuishao thedominationcomplexityandrelatedextremalvaluesoflarge3dtorus
AT jinxu thedominationcomplexityandrelatedextremalvaluesoflarge3dtorus
AT smsheikholeslami thedominationcomplexityandrelatedextremalvaluesoflarge3dtorus
AT shaohuiwang thedominationcomplexityandrelatedextremalvaluesoflarge3dtorus
AT zehuishao dominationcomplexityandrelatedextremalvaluesoflarge3dtorus
AT jinxu dominationcomplexityandrelatedextremalvaluesoflarge3dtorus
AT smsheikholeslami dominationcomplexityandrelatedextremalvaluesoflarge3dtorus
AT shaohuiwang dominationcomplexityandrelatedextremalvaluesoflarge3dtorus
_version_ 1724982391005511680

Similar Items