No CrossRef data available.
Published online by Cambridge University Press: 20 November 2018
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.
This work is supported by NSFXJ (No. 2012211A058).