Bounds and extremal graphs for Harary energy

2021 
Let G be a connected graph of order n and let RD(G) be the reciprocal distance matrix (also called Harary matrix) of the graph G. Let ρ1 ≥ ρ2 ≥⋯ ≥ ρn be the eigenvalues of the reciprocal distance m...
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []