Name
Abstract | ||
|---|---|---|
Let G be a graph of order n and let di be the degree of the vertex vi in G for i=1,2,…,n. The weighted adjacency matrix Adb of G is defined so that its (i, j)-entry is equal to di+djdidj if the vertices vi and vj are adjacent, and 0 otherwise. The spectral radius ϱ1 and the energy Edb of the Adb-matrix are examined. Lower and upper bounds on ϱ1 and Edb are obtained, and the respective extremal graphs are characterized. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.amc.2018.08.012 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Weighted adjacency matrix,Weighted spectral radius,Weighted energy | Adjacency matrix,Graph,Combinatorics,Spectral radius,Vertex (geometry),Mathematical analysis,Mathematics | Journal |
Volume | ISSN | Citations |
340 | 0096-3003 | 0 |
PageRank | References | Authors |
0.34 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Baogen Xu | 1 | 122 | 19.54 |
| Shuchao Li | 2 | 183 | 35.15 |
| Rong Yu | 3 | 1441 | 86.78 |
| Qin Zhao | 4 | 12 | 2.60 |