Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network

DOI10.1155/2020/5307670zbMath1441.05055OpenAlexW3034591832MaRDI QIDQ781753

Zhi-Yu Shi, Jing Zhao, Jia-Bao Liu, Cao, Jinde, Fuad Eid S. Alsaadi

Publication date: 18 July 2020

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/5307670

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hypergraphs (05C65) Distance in graphs (05C12) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes
• The Kirchhoff indexes of some composite networks
• Edge fault tolerance of super edge connectivity for three families of interconnection networks
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Complete characterization of bicyclic graphs with minimal Kirchhoff index
• Kirchhoff index of composite graphs
• Some properties on Estrada index of folded hypercubes networks
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• Bounds for the Kirchhoff index via majorization techniques
• A discrete random walk on the hypercube
• The Kirchhoff index of hypercubes and related complex networks
• Perfect matchings extend to Hamilton cycles in hypercubes
• Edge-fault tolerance of hypercube-like networks

This page was built for publication: Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network