Vertex Removal and the Edge Domination Number of Graphs
Abstract views: 21 / PDF downloads: 17
Keywords:
Edge domination, edge domination number, edge private neighborhoodAbstract
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.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 International Journal of Mathematics And its Applications
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.