Resistance distance in \(H\)-join of graphs \(G_1,G_2,\dots,G_k\)

DOI10.3390/math6120283zbMath1425.05050OpenAlexW2902310031MaRDI QIDQ2337244

Jing Zhao, Micheal Arockiaraj, Li Zhang, Jia-Bao Liu

Publication date: 19 November 2019

Published in: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/math6120283

zbMATH Keywords

graphLaplacian matrixgroup inverseresistance distance

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

Resistance distance of generalized wheel and dumbbell graph using symmetric {1}-inverse of Laplacian matrix ⋮ Resistance distance in potting networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degree resistance distance of cacti
• Spectra of coronae
• Complete characterization of bicyclic graphs with minimal Kirchhoff index
• Resistance distance in wheels and fans
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• Spectra of graphs obtained by a generalization of the join graph operation
• Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae
• Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
• Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter
• Line star sets for Laplacian eigenvalues
• Some results on resistance distances and resistance matrices
• The {1}-inverse of the Laplacian of subdivision-vertex and subdivision-edge coronae with applications
• The Group Inverse of the Laplacian Matrix of a Graph
• The signless Laplacian spectra of the corona and edge corona of two graphs
• Resistance distances in corona and neighborhood corona networks based on Laplacian generalized inverse approach

This page was built for publication: Resistance distance in \(H\)-join of graphs \(G_1,G_2,\dots,G_k\)