A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Strong equality of domination parameters in trees
2003
Discrete Mathematics
We study the concept of strong equality of domination parameters. Let P1 and P2 be properties of vertex subsets of a graph, and assume that every subset of V (G) with property P2 also has property P1. Let 1(G) and 2(G), respectively, denote the minimum cardinalities of sets with properties P1 and P2, respectively. Then 1(G) 6 2(G). If 1(G)= 2(G) and every 1(G)-set is also a 2(G)-set, then we say 1(G) strongly equals 2(G), written 1(G) ≡ 2(G). We provide a constructive characterization of the
doi:10.1016/s0012-365x(02)00451-x
fatcat:bdignvioj5abrisjidnkso63zm