Open AccessInverse Equality Co-Neighborhood Domination in Graphs
Author(s) -
Sahib Sh. Kahat,
Manal N. Al-Harere
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1879/3/032036
Subject(s) - dominating set , combinatorics , mathematics , inverse , vertex (graph theory) , undirected graph , graph , simple (philosophy) , set (abstract data type) , domination analysis , simple graph , discrete mathematics , computer science , geometry , philosophy , epistemology , programming language
Let G = (V, E ) be a simple undirected graph without isolated vertices. A proper subset D ⊂ V is called equality co-neighborhood dominating set of G (ENDS), if every vertex in set D is adjacent to equally number of vertices in V - D . In this paper, the inverse equality co-neighborhood dominating set of G (IENDS) is defined. Some properties of inverse equality co-neighborhood dominating set are determined. The inverse equality co-neighborhood domination number in some special graphs and three kinds of operations in join graphs is calculated.