As corollaries, we prove that Independent Domination Problem is NP-hard within the class of all 2 P 3 -free perfect graphs and for K 1 , 5 -free weakly chordal ...
Abstract. We investigate Independent Domination Problem within hereditary classes of graphs. Boliac and Lozin [Independent domination.
Independent domination in hereditary classes. March 2006 ... Independent Domination is harder than Independent Set Problem within hereditary classes.
We investigate Independent Domination Problem within hereditary classes of graphs. Boliac and Lozin [Independent domination in finitely defined classes of ...
Semantic Scholar extracted view of "Independent domination in hereditary classes" by I. Zverovich et al.
Independent domination in hereditary classes (Q818132). From MaRDI portal. Jump to:navigation, search. scientific article. In more languages.
We investigate Independent Domination Problem within hereditary classes ... Independent Domination is harder than Independent Set Problem within hereditary ...
People also ask
Which of the following is dominant in hereditary?
What are hereditary classes?
Hereditary domination and inde- pendence parameters. Discuss. Math. Graph Theory, 24:239–248, 2004. [53] W. Goddard and M.A. Henning. Nordhaus-Gaddum bounds ...
Keywords: Satgraphs; Satisfiability problem; Hereditary class of graphs; Forbidden induced subgraph characterization; Independent domination problem; Polar ...
A graph is a hereditary dominating pair graph iff every connected induced subgraph is a weak dominating pair graph. References. [1211]. Deogun, Jitender S.; ...