论文信息 - Extremal graphs for inequalities involving domination parameters

Extremal graphs for inequalities involving domination parameters

Abstract A characterization of n-vertex isolate-free connected graphs G whose domination number γ ( G ) satisfies γ(G)=⌊n/2⌋ is obtained. This result enables us to obtain extremal graphs of inequalities which bound the sum of two domination parameters in isolate-free graphs.

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] Frank Harary,et al. Double Domination in Graphs , 2000, Ars Comb..

[3] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[4] Stephen T. Hedetniemi,et al. Bibliography on domination in graphs and some basic definitions of domination parameters , 1991, Discret. Math..

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

[6] F. Bruce Shepherd,et al. Domination in graphs with minimum degree two , 1989, J. Graph Theory.

[7] Charles Payan,et al. Domination-balanced graphs , 1982, J. Graph Theory.

[8] O. Ore. Theory of Graphs , 1962 .

[9] Frank Harary,et al. The $k$-tuple domatic number of a graph , 1998 .