Edge Dominating Sets and Vertex Covers
Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 2, p. 437.
Voir la notice de l'article dans European Digital Mathematics Library
Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering, edge domination, and matching parameters is explored. In addition, the total vertex cover number is compared to the total domination number of trees and grid graphs.
Classification :
05C30, 05C69, 05C70
Mots-clés : edge dominating set, matching, total dominating set, vertex cover
Mots-clés : edge dominating set, matching, total dominating set, vertex cover
@article{DMGT_2013__33_2_267536, author = {Ronald Dutton and William F. Klostermeyer}, title = {Edge {Dominating} {Sets} and {Vertex} {Covers}}, journal = {Discussiones Mathematicae Graph Theory}, pages = {437}, publisher = {mathdoc}, volume = {33}, number = {2}, year = {2013}, zbl = {1300.05217}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_2_267536/} }
TY - JOUR AU - Ronald Dutton AU - William F. Klostermeyer TI - Edge Dominating Sets and Vertex Covers JO - Discussiones Mathematicae Graph Theory PY - 2013 SP - 437 VL - 33 IS - 2 PB - mathdoc UR - https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_2_267536/ LA - en ID - DMGT_2013__33_2_267536 ER -
Ronald Dutton; William F. Klostermeyer. Edge Dominating Sets and Vertex Covers. Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 2, p. 437. https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_2_267536/