Degree equitable restrained double domination in graphs

Degree equitable restrained double domination in graphs

<p class="p1">A subset <em>D</em> ⊆ <em>V</em>(<em>G</em>) is called an equitable dominating set of a graph <em>G</em> if every vertex <em>v</em> ∈ <em>V</em>(<em>G</em>) \ <em>D</em> has...

Full description

Bibliographic Details
Main Authors: Sunilkumar M Hosamani, Shailaja Shirkol, Preeti B. Jinagouda, Marcin Krzywkowski
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2021-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
domination, degree equitable domination, derd-domination
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/445

Internet

https://www.ejgta.org/index.php/ejgta/article/view/445

Similar Items