Name
Abstract | ||
|---|---|---|
A cactus is a connected graph in which any two cycles have at most one common vertex. The distance spectral radius ź(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Recently, many researchers proposed the use of ź(G) as a molecular structure descriptor of alkanes. In this paper, we characterize n-vertex cyclic cactus with given matching number m which minimizes the distance spectral radius. The resulting cactus also minimizes the Hosoya index, the Wiener index and the Randić index in the same class of graphs. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.amc.2016.06.031 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Distance spectral radius,Cactus,Matching number,Perfect matching | Combinatorics,Wiener index,Spectral radius,Vertex (geometry),Hosoya index,Matching (graph theory),Distance matrix,Connectivity,Mathematics,Eigenvalues and eigenvectors | Journal |
Volume | Issue | ISSN |
291 | C | 0096-3003 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minjie Zhang | 1 | 255 | 30.01 |
| Shuchao Li | 2 | 183 | 35.15 |