Name
Abstract | ||
|---|---|---|
In this paper, we show that among all connected graphs of order n with diameter D, the graph G* has maximal spectral radius, where G* is obtained from Kn-D boolean OR (K-2) over bar by attaching two paths of order l(1) and l(2) to the two vertices u, v in (K-2) over bar, respectively, and l(1) + l(2) = D-2, vertical bar l(1) - l(2)vertical bar <= 1. |
Year | DOI | Venue |
|---|---|---|
2011 | null | ARS COMBINATORIA |
Keywords | Field | DocType |
Graph,Diameter,Spectral radius | Graph,Discrete mathematics,Spectral radius,Radius of curvature,Radius,Geometry,Mathematics | Journal |
Volume | Issue | ISSN |
98 | null | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lihua Feng | 1 | 1 | 1.04 |