Loading...
Please wait, while we are loading the content...
Similar Documents
On the spectral radius of graphs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Yu, Aimei Tian, Feng |
| Copyright Year | 2003 |
| Abstract | Let G be a simple undirected graph. For v ∈ V (G), the 2-degree of v is the sum of the degrees of the vertices adjacent to v. Denote by ρ(G) and μ(G) the spectral radius of the adjacency matrix and the Laplacian matrix of G, respectively. In this paper, we present two lower bounds of ρ(G) and μ(G) in terms of the degrees and the 2-degrees of vertices. © 2004 Elsevier Inc. All rights reserved. AMS classification: 05C50; 15A18 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://orsc.edu.cn/~mlu/Yulutian(04laa).pdf |
| Alternate Webpage(s) | http://madis1.iss.ac.cn/madis.files/pub-papers/science4.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Adjacency matrix Graph - visual representation Laplacian matrix Undirected Graph Vertex (geometry) |
| Content Type | Text |
| Resource Type | Article |
