Bibliographic Details
| Title: |
ON DOMINATION IN COARSE DEG-CENTRIC GRAPHS. |
| Authors: |
Thalavayalil, Timmy Tomy1 timmy@kristujayanti.com, Joyson, Ann Mary1 annmary@kristujayanti.com, Gopalakrishnan, Mini1 mini.g@kristujayanti.com |
| Source: |
Advances & Applications in Discrete Mathematics. Apr2026, Vol. 43 Issue 3, p321-336. 16p. |
| Subjects: |
Dominating set, Graph theory |
| Abstract: |
The coarse deg-centric graph of a graph G, denoted by, Gcd is the graph with V(Gcd) = V(G) and E(Gcd) = [νiνj : dG(νiνj) > degG(νi)}. This transformation of the graph is called coarse deg-centrication of the graph. In this paper, we study the domination and domination number of coarse deg-centric graphs. Furthermore, we explore their fundamental properties and structural characteristics, offering insights into their behavior under various graph operations. [ABSTRACT FROM AUTHOR] |
|
Copyright of Advances & Applications in Discrete Mathematics is the property of Pushpa Publishing House and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
