Maximizing the Index of Trees with Given Domination Number
Printed: Sep 2014
The index of a graph $G$ is the maximum
eigenvalue of its adjacency matrix $A(G)$. In this paper we
characterize the extremal tree with given
domination number that attains the maximum index.
trees, spectral radius, index, domination number
05C50 - Graphs and linear algebra (matrices, eigenvalues, etc.)