Abstract
For a connected graph G=(V,E), the dominating set in graph G is a subset of vertices F⊂V such that every vertex of V−F is adjacent to at least one vertex of F. The minimum cardinality of a dominating set of G, denoted by γ(G), is the domination number of G. The edge dominating set in graph G is a subset of edges S⊂E such that every edge of E−S is adjacent to at least one edge of S. The minimum cardinality of an edge dominating set of G, denoted by γ′(G), is the edge domination number of G. In this paper, we characterize all trees and claw-free cubic graphs with equal domination and edge domination numbers, respectively.
Full Text
Published Version
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 call