[1] Archdeacon, D., Ellis-Monaghan, J., Fisher, D., Froncek, D., Lam, P. C. B., Seager, S., Wei, B., Yuster, R.:
Some remarks on domination. J. Graph Theory 46 (2004), 207-210.
MR 2063370 |
Zbl 1041.05057
[2] Cockayne, E. J., Dawes, R. M., Hedetniemi, S. T.:
Total domination in graphs. Networks 10 (1980), 211-219.
MR 0584887 |
Zbl 0447.05039
[3] Dunbar, J. E., Hedetniemi, S. T., Henning, M. A., Slater, P. J.:
Signed domination number of a graph. In: Graph Theory, Combinatorics, and Applications, John Wiley & Sons (1995), 311-322.
MR 1405819
[4] Fallat, S. M., Kirkland, S., Pati, S.:
On graphs with algebraic connectivity equal to minimum edge density. Linear Algebra Appl. 373 (2003), 31-50.
MR 2022276 |
Zbl 1026.05075
[5] Feng, L., Yu, G., Li, Q.:
Minimizing the Laplacian eigenvalues for trees with given domination number. Linear Algebra Appl. 419 (2006), 648-655.
MR 2277995 |
Zbl 1110.05060
[7] Grone, R., Merris, R.:
The Laplacian spectrum of a graph (II). SIAM J. Discrete Math. 7 (1994), 221-229.
MR 1271994 |
Zbl 0795.05092
[8] Haynes, T. W., Hedetniemi, S. T., Slater, P. J.:
Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998).
MR 1605684 |
Zbl 0890.05002
[9] Henning, M. A., Slater, P. J.:
Inequality relation domination parameters in cube graph. Discrete Math. 158 (1996), 87-98.
MR 1411112
[10] Henning, M. A.:
Graphs with large total domination number. J. Graph Theory 35 (2000), 21-45.
MR 1775793 |
Zbl 0959.05089
[11] Lu, M., Liu, H., Tian, F.:
Bounds of Laplacian spectrum of graphs based on the domination number. Linear Algebra Appl. 402 (2005), 390-396.
MR 2141097 |
Zbl 1063.05095
[12] Merris, R.:
Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197/198 (1998), 143-176.
MR 1275613
[13] Nikiforov, V.:
Bounds on graph eigenvalues I. Linear Algebra Appl. 420 (2007), 667-671.
MR 2278241 |
Zbl 1109.05073