Name
Abstract | ||
|---|---|---|
Let Jn, be the set of tricyclic graphs of order n. In this paper, we use a new proof to determine the unique graph with maximal spectral radius among all graphs in Jn for each n >= 4. Also, we determine the unique graph with minimal least eigenvalue among all graphs in this class for each n >= 52. We can observe that the graph with maximal spectral radius is not the same as the one with minimal least eigenvalue in Jn, which is different from those on the unicyclic and bicyclic graphs. |
Year | DOI | Venue |
|---|---|---|
2011 | null | ARS COMBINATORIA |
Keywords | Field | DocType |
Tricyclic graph,Spectral radius,Least eigenvalue | Discrete mathematics,Graph,Combinatorics,Tricyclic,Mathematics | Journal |
Volume | Issue | ISSN |
100 | null | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruifang Liu | 1 | 4 | 2.58 |
| Huicai Jia | 2 | 4 | 1.80 |
| Jinlong Shu | 3 | 99 | 24.28 |