Article contents
Maximizing the Index of Trees with Given Domination Number
Published online by Cambridge University Press: 20 November 2018
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 2014
Footnotes
This work is supported by NSFXJ (No. 2012211A058).
References
- 1
- Cited by