×

On domination and independence numbers of graphs. (English) Zbl 0748.05066

The authors characterize those graphs which (1) have equal domination and independence numbers, and (2) are either bipartite or are block graphs, i.e., graphs in which every block is a complete graph.

MSC:

05C35 Extremal problems in graph theory
05C75 Structural characterization of families of graphs
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] M. Borowiecki, On a minimaximal kernel of trees, Discuss. Math. 1 (1975) 3–6. · Zbl 0418.05016
[2] E. J. Cockayne, Domination of undirected graphs – a survey, In: Y. Alavi and D. R. Lick, eds., Theory and Applications of Graphs, Lecture Notes in Math. 642, Springer - Verlag,Berlin – Heidelberg – New York, 1978, 141–147. · Zbl 0384.05052
[3] E. J. Cockayne and S. Hedetniemi, Towards a theory of domination in graphs, Networks 7 (1977) 247–261. · Zbl 0384.05051 · doi:10.1002/net.3230070305
[4] J. F. Fink, M. S. Jacobson, L. F. Kinch, and J. Roberts, On graphs having domination number half their order, Period. Math. Hung. 16 (1985) 287–293. · Zbl 0602.05043 · doi:10.1007/BF01848079
[5] F. Harary, Graph Theory, Addison - Wesley, Reading, Mass., 1969.
[6] L. Szamkołowicz, Sur la classification des graphes en vue des propriétés de leurs noyaux, Prace Nauk. Inst. Mat. i Fiz. Teoret., Politech. Wrocław., Ser. Stud. Mater. 3 (1970) 15–21.
[7] L. Szamkołowicz, Teoria grafów skończonych, Ossolineum, Wrocław, 1971.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.