About this document
Edge-Vertex Domination in Graphs by christythangapandi25 is a document available to read on EtoBox.
This paper explores edge-vertex domination (ev-domination) in graphs, providing characterizations of minimal ev-dominating sets and conditions affecting the ev-domination number when vertices or edges are removed. It establishes that the complement of a minimal ev-dominating set is an edge dominating set in graphs with a minimum vertex degree of at least 2. The authors also present theorems detailing how the ev-domination number can increase, decrease, or remain unchanged based on the removal of vertices or
- Author
- christythangapandi25
- Language
- EN