Name
Abstract | ||
|---|---|---|
We consider the connected graphs with a unique vertex of maximum degree 3. Two subfamilies of such graphs are characterized and ordered completely by their indices. Moreover, a conjecture about the complete ordering of all graphs in this set is proposed. |
Year | DOI | Venue |
|---|---|---|
2009 | null | ARS COMBINATORIA |
Keywords | Field | DocType |
Characteristic polynomial,Index,Graphs | Discrete mathematics,Graph,Combinatorics,Degree (graph theory),Mathematics | Journal |
Volume | Issue | ISSN |
91 | null | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kexiang Xu | 1 | 72 | 11.43 |
| Baogang Xu | 2 | 389 | 37.90 |