24Some New Results on Restrained Edge Domination Number of Graphs
S. K. Vaidya
Saurashtra UniversityRajkot, Gujarat (INDIA)E-mail: samirkvaidya@yahoo.co.in
P. D. Ajani
Atmiya UniversityRajkot, Gujarat (INDIA)E-mail: paragajani@gmail.com
For a graph G = (V, E), a subset D of E is a restrained edge dominating set of G if every edge not in D is adjacent to an edge in D as well as an edge in E − D. The restrained edge domination number of G, denoted by γre(G) is the minimum cardinality of a restrained edge dominating set of G. In this chapter, we characterize a restrained edge dominating set and also investigate a restrained edge domination number of book graph Bn, crown Crn, armed crown ACrn and friendship graph Fn.
The concept ...
Get Recent Advancements in Graph Theory now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
