Restrained Edge Domination Number of Some Path Related Graphs

Authors

  • S. K. Vaidya Department of Mathematics, Saurashtra University, Rajkot-360005, India
  • P. D. Ajani Department of Mathematics, Atmiya University, Rajkot-360005, India

DOI:

https://doi.org/10.3329/jsr.v13i1.48520

Abstract

For a graph G = (V,E), a set  S ⊆ V(S ⊆ E) is a restrained dominating (restrained edge dominating) set if every vertex (edge) not in S is adjacent (incident) to a vertex (edge) in S and to a vertex (edge) in V - S(E-S). The minimum cardinality of a restrained dominating (restrained edge dominating) set of G is called restrained domination (restrained edge domination) number of G, denoted by  γr (G) (γre(G). The restrained edge domination number of some standard graphs are already investigated while in this paper the restrained edge domination number like degree splitting, switching,  square and middle graph obtained from path.

Downloads

Download data is not yet available.
Abstract
21
pdf
25

Downloads

Published

2021-01-01

How to Cite

Vaidya, S. K., & Ajani, P. D. (2021). Restrained Edge Domination Number of Some Path Related Graphs. Journal of Scientific Research, 13(1), 145–151. https://doi.org/10.3329/jsr.v13i1.48520

Issue

Vol. 13 No. 1 (2021)

Section

Section A: Physical and Mathematical Sciences

License

© Journal of Scientific Research

Creative Commons License

Articles published in the "Journal of Scientific Research" are Open Access articles under a Creative Commons Attribution-ShareAlike 4.0 International license (CC BY-SA 4.0). This license permits use, distribution and reproduction in any medium, provided the original work is properly cited and initial publication in this journal. In addition to that, users must provide a link to the license, indicate if changes are made and distribute using the same license as original if the original content has been remixed, transformed or built upon.