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 ED. 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.

24.1Introduction

The concept ...

Get Recent Advancements in Graph Theory now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.