Abstract
For a graph G=V,E, a subset F of E is called an edge dominating set of G if every edge not in F is adjacent to some edge in F. The edge domination number γ′G of G is the minimum cardinality taken over all edge dominating sets of G. Here, we determine the edge domination number for shadow graphs, middle graphs, and total graphs of paths and cycles.
Full Text
Published Version (
Free)
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