Edge dominating sets and vertex covers

Document Type

Article

Publication Date

4-29-2013

Abstract

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.

Publication Title

Discussiones Mathematicae - Graph Theory

Volume

33

Issue

2

First Page

437

Last Page

456

Digital Object Identifier (DOI)

10.7151/dmgt.1681

ISSN

12343099

Link to Full Text

Share

COinS