Abstract
In a graph G, a vertex v is dominated by an edge e, if e is incident with v or e is incident with a vertex which is a neighbor of v. An edge-vertex dominating set D is a subset of the edge set of G such that every vertex of G is edge-vertex dominated by an edge of D. The ev-domination number equals to the number of an edge-vertex dominating set of G which has minimum cardinality and it is denoted by γev (G). We here analyze double edge-vertex domination such that a double edge-vertex dominating set D is a subset of the edge set of G, provided that all vertices in G are ev-dominated by at least two edges of D. The double ev-domination number equals to the number of an double edge-vertex dominating set of G which has minimum cardinality and it is denoted by γdev (G). We demonstrate that the enumeration of the double ev-domination number of chordal graphs is NP-complete. Moreover several results about total domination number and double ev-domination number are obtained for trees.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
