Bounds of the Spectral Radius and the Nordhaus-Gaddum Type of the Graphs
The Laplacian spectra are the eigenvalues of Laplacian matrix L(G)=D(G)-A(G), where D(G) and A(G) are the diagonal matrix of vertex degrees and the adjacency matrix of a graph G, respectively, and the spectral radius of a graph G is the largest eigenvalue of A(G). The spectra of the graph and corres...
Saved in:
Main Authors: | Tianfei Wang, Liping Jia, Feng Sun |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2013/472956 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Bounds on the Spectral Radius of a Nonnegative Matrix and Its Applications
by: Danping Huang, et al.
Published: (2016-01-01) -
Comparison Theorems of Spectral Radius for Splittings of Matrices
by: Cui-Xia Li, et al.
Published: (2014-01-01) -
A formula to calculate the spectral radius of a compact linear operator
by: Fernando Garibay Bonales, et al.
Published: (1997-01-01) -
Spectral deviations of graphs
by: Stanić Zoran
Published: (2025-02-01) -
Spectral Sufficient Conditions on Pancyclic Graphs
by: Guidong Yu, et al.
Published: (2021-01-01)