Vertex Removal and the Edge Domination Number of Graphs


Abstract views: 20 / PDF downloads: 15

Authors

  • D. K. Thakkar Department of Mathematics, Saurashtra University, Rajkot, Gujarat, India
  • B. M. Kakrecha Department of Mathematics, L.E.College, Morbi, Gujarat, India

Keywords:

Edge domination, edge domination number, edge private neighborhood

Abstract

The paper is about the edge domination of the graph. The change in the edge domination number is observed under the operation of vertex removal. Necessary and sufficient condition is proved under which the edge domination number decreases when a vertex is removed from the graph. Calculation of the number of minimum edge dominating sets of the graph is given.

 

 

Author Biographies

D. K. Thakkar, Department of Mathematics, Saurashtra University, Rajkot, Gujarat, India

 

 

B. M. Kakrecha, Department of Mathematics, L.E.College, Morbi, Gujarat, India

 

 

Downloads

Published

01-05-2016

How to Cite

D. K. Thakkar, & B. M. Kakrecha. (2016). Vertex Removal and the Edge Domination Number of Graphs. International Journal of Mathematics And Its Applications, 4(2 - A), 1–5. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/999

Issue

Vol. 4 No. 2 - A (2016)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.