Abstract
A dominating set in a graph G is a set S of vertices such that every vertex that does not belong to S is adjacent to a vertex in S. The domination number γ(G) of G is the minimum cardinality of a dominating set of G. The common independence number αc(G) of G is the greatest integer r such that every vertex of G belongs to some independent set of cardinality at least r. The common independence number is squeezed between the independent domination number i(G) and the independence number α(G) of G, that is, γ(G)≤i(G)≤αc(G)≤α(G). A graph G is domination perfect if γ(H)=i(H) for every induced subgraph H of G. We define a graph G as common domination perfect if γ(H)=αc(H) for every induced subgraph H of G. We provide a characterization of common domination perfect graphs in terms of ten forbidden induced subgraphs.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
