On graphs with maximum Harary spectral radius

2015 
Let G be a connected (molecular) graph with vertex set V ( G ) = { v 1 , v 2 , , v n } . The Harary matrix RD(G) of G, which is also known as the reciprocal distance matrix, is an n n matrix whose ...
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []