A sharp upper bound on the incidence energy of graphs in terms of connectivity (Q1931756)

From MaRDI portal
Revision as of 12:04, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A sharp upper bound on the incidence energy of graphs in terms of connectivity
scientific article

    Statements

    A sharp upper bound on the incidence energy of graphs in terms of connectivity (English)
    0 references
    0 references
    0 references
    16 January 2013
    0 references
    0 references
    Laplacian matrix
    0 references
    Laplacian-energy like
    0 references
    signless Laplacian matrix
    0 references
    signless Laplacian eigenvalues
    0 references
    incidence energy
    0 references
    vertex connectivity
    0 references