Independence and domination in divisor graph and mod‑difference graphs | ||||
| Journal of the Egyptian Mathematical Society | ||||
| Volume 31, Issue 1, 2023, Page 1-13 PDF (3.38 MB) | ||||
| Document Type: Original Article | ||||
| DOI: 10.1186/s42787-023-00159-0 | ||||
 View on SCiNiTO | ||||
| Author | ||||
| Sayed Elsakhawy | ||||
| Department of Mathematics, Faculty of Science, Ain Shams University, Abbassia, Cairo, Egypt | ||||
| Abstract | ||||
| We initiate the study of domination and inverse domination in labeled graphs. In this paper, we determined the cardinality of maximal independent and minimum variant dominating (total dominating/independent dominating/co-independent dominating) sets and their inverse in divisor graph and in two new labeling definitions called 0-mod-difference and 1-mod-difference graphs. | ||||
|
Statistics Article View: 27 PDF Download: 18 |
||||
