WHOLE DOMINATION IN GRAPHS

In this paper, a new parameter of domination number in graphs is defined which is called whole domination number denoted by [[gamma].sub.wh](G). Some bounds of whole domination number and the number of edges depend on it has been established. Furthermore, the effect of deletion vertex, edge, or add...

Full description

Saved in:
Bibliographic Details
Published inTWMS journal of applied and engineering mathematics Vol. 12; no. 4; p. 1506
Main Authors Omran, Ahmed A, Ibrahim, Thaer A
Format Journal Article
LanguageEnglish
Published Istanbul Turkic World Mathematical Society 01.01.2022
Elman Hasanoglu
Subjects
Education
Graph theory
Graphs
Mathematical research
Mathematics
Iraq
Online AccessGet full text
ISSN2146-1147
2146-1147

Cover

More Information
Summary:In this paper, a new parameter of domination number in graphs is defined which is called whole domination number denoted by [[gamma].sub.wh](G). Some bounds of whole domination number and the number of edges depend on it has been established. Furthermore, the effect of deletion vertex, edge, or add edge have been studied. Also, the effect of the contracting an edge is determined. Finally, some operations between the two graphs have been calculated. Keywords: Whole dominating set, Whole domination number, Deletion, Contracting an edge. AMS Subject Classification: 05C69.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2146-1147
2146-1147