Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647781 | Discrete Mathematics | 2013 | 9 Pages |
Abstract
The kth power of a graph GG, denoted by GkGk, is the graph with the same vertex set as GG, such that two vertices are adjacent in GkGk if and only if their distance is at most kk in GG. In this paper, we give bounds on the first two largest Laplacian eigenvalues of the second power of a general graph, and on the second power of a tree. We also give a Nordhaus–Gaddum-type inequality for the Laplacian spectral radius of G2G2.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Kinkar Ch. Das, Ji-Ming Guo,