1. Eigenvalues and diameter.
- Author
-
Liu, Hui and Lu, Mei
- Subjects
- *
EIGENVALUES , *GRAPH connectivity , *PATHS & cycles in graph theory , *MATRICES (Mathematics) , *MATHEMATICAL analysis , *GRAPH theory - Abstract
Let G be a connected graph of order n. The diameter of a graph is the maximum distance between any two vertices of G. In this paper, we will give some bounds on the diameter of G in terms of eigenvalues of adjacency matrix and Laplacian matrix, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF