Edge dominating sets and vertex covers | Zendy

Ronald D. Dutton | Zendy; William F. Klostermeyer | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Edge dominating sets and vertex covers

Author(s) -

Ronald D. Dutton,

William F. Klostermeyer

Publication year - 2013

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1681

Subject(s) - combinatorics , mathematics , vertex cover , vertex (graph theory) , bipartite graph , edge cover , dominating set , domination analysis , matching (statistics) , neighbourhood (mathematics) , graph , discrete mathematics , statistics , mathematical analysis

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research