Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network (Q781753): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Cao, Jinde / rank
 
Normal rank
Property / author
 
Property / author: Fuad Eid S. Alsaadi / rank
 
Normal rank

Revision as of 23:50, 9 February 2024

scientific article
Language Label Description Also known as
English
Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network
scientific article

    Statements

    Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 July 2020
    0 references
    Summary: The hypercube \(Q_n\) is one of the most admirable and efficient interconnection network due to its excellent performance for some practical applications. The Kirchhoff index \(\text{Kf}\left( G\right)\) is equal to the sum of resistance distances between any pairs of vertices in networks. In this paper, we deduce some bounds with respect to Kirchhoff index of hypercube network \(Q_n\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references