Maximizing the Index of Trees with Given Domination Number
Canadian mathematical bulletin, Tome 57 (2014) no. 3, pp. 520-525
Voir la notice de l'article provenant de la source Cambridge
The index of a graph $G$ is the maximum eigenvalue of its adjacency matrix $A\left( G \right)$ . In this paper we characterize the extremal tree with given domination number that attains the maximum index.
Guo, Guangquan; Wang, Guoping. Maximizing the Index of Trees with Given Domination Number. Canadian mathematical bulletin, Tome 57 (2014) no. 3, pp. 520-525. doi: 10.4153/CMB-2014-023-5
@article{10_4153_CMB_2014_023_5,
author = {Guo, Guangquan and Wang, Guoping},
title = {Maximizing the {Index} of {Trees} with {Given} {Domination} {Number}},
journal = {Canadian mathematical bulletin},
pages = {520--525},
year = {2014},
volume = {57},
number = {3},
doi = {10.4153/CMB-2014-023-5},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-2014-023-5/}
}
TY - JOUR AU - Guo, Guangquan AU - Wang, Guoping TI - Maximizing the Index of Trees with Given Domination Number JO - Canadian mathematical bulletin PY - 2014 SP - 520 EP - 525 VL - 57 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.4153/CMB-2014-023-5/ DO - 10.4153/CMB-2014-023-5 ID - 10_4153_CMB_2014_023_5 ER -
Cité par Sources :