Dominating Sets for Split and Bipartite Graphs

Abstract A dominating set of an undirected graph G is a set D of nodes such that every node of G either is in D or is adjacent to some node of D. It is shown that the problem of finding a minimum cardinality dominating set is NP-complete for split graphs (a subclass of chordal graphs) and bipartite graphs.

[1]  Stephen T. Hedetniemi,et al.  Optimal domination in graphs , 1975 .

[2]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[3]  Stephen T. Hedetniemi,et al.  Disjoint independent dominating sets in graphs , 1976, Discret. Math..

[4]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[5]  Stephen T. Hedetniemi,et al.  A Linear Algorithm for the Domination Number of a Tree , 1975, Inf. Process. Lett..

[6]  Odile Favaron,et al.  Contributions to the theory of domination, independence and irredundance in graphs , 1981, Discret. Math..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Kellogg S. Booth,et al.  Dominating Sets in Chordal Graphs , 1982, SIAM J. Comput..

[9]  Peter J. Slater,et al.  R-Domination in Graphs , 1976, J. ACM.

[10]  Béla Bollobás,et al.  Graph-theoretic parameters concerning domination, independence, and irredundance , 1979, J. Graph Theory.

[11]  Stephen T. Hedetniemi,et al.  Total domination in graphs , 1980, Networks.

[12]  Stephen T. Hedetniemi,et al.  Towards a theory of domination in graphs , 1977, Networks.

[13]  Robert B. Allan,et al.  On domination and independent domination numbers of a graph , 1978, Discret. Math..

[14]  C. L. Liu,et al.  Introduction to Combinatorial Mathematics. , 1971 .

[15]  Lee J. White,et al.  Optimum Domination in Weighted Trees , 1978, Inf. Process. Lett..

[16]  Maurizio A. BONUCCELLI.  Dominating sets and domatic number of circular arc graphs , 1985, Discret. Appl. Math..