Edge dominating sets and vertex covers

DOI10.7151/DMGT.1681MaRDI QIDQ2860871zbMATH OpenOpenAlexFDO

Authors William F. Klostermeyer, Ronald D. Dutton

Publication date 11 November 2013

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.7151/dmgt.1681

zbMATH Keywords

matchingtotal dominating setvertex coveredge dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(7)

• A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
• Vertex cover and edge-vertex domination in trees
• Edge dominating set and colorings on graphs with fixed clique-width
• Edge domination in some path and cycle related graphs
• Strong and weak edges of a graph and linkages with the vertex cover problem
• scientific article; zbMATH DE number 1792649 (Why is no real title available?)
• Dominating vertex covers: the vertex-edge domination problem

This page was built for publication: Edge dominating sets and vertex covers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2860871)