Resistance distance and spanning trees of generalized multiple complete split-like graph

DOI10.1016/J.DAM.2025.11.001MaRDI QIDQ6866673zbMATH OpenFDO

Authors Chenlin Yang, Tao Tian, Shuming Zhou

Publication date 28 January 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.11.001

zbMATH Keywords

complete split graphLaplacian spectrumresistance distancespanning tree

Mathematics Subject Classification ID

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

Cites work

• A theorem on trees.
• Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron
• Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs
• Counting spanning trees in a complete bipartite graph which contain a given spanning forest
• Counting spanning trees of multiple complete split-like graph containing a given spanning forest
• Counting spanning trees with a Kekulé structure in linear hexagonal chains
• Effective resistances and spanning trees in the complete bipartite graph plus a matching
• Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
• Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
• Graph theory with applications
• Hitting time, resistance distance and Kirchhoff index of Cayley graphs over dicyclic and semi-dihedral groups
• Integral complete split graphs
• Laplacian graph eigenvectors
• On $W$-bases of directed graphs
• On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs
• Resistance between two nodes of a ring clique network
• Resistance between two nodes of a ring network
• Resistance distance and Kirchhoff index in dihedral Cayley graphs
• Resistance distance and Kirchhoff index of the Q-vertex (or edge) join graphs
• Resistance distance and spanning trees of multiple extended complete split-like graph
• Resistance distance in complete n-partite graphs
• Resistance distance in connected balanced digraphs
• Resistance distance in generalized core-satellite graphs
• Resistance distance in potting networks
• Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
• Resistance distances and the Moon-type formula of a vertex-weighted complete split graph
• Resistance distances in vertex-weighted complete multipartite graphs
• Spanning tree enumeration and nearly triangular graph Laplacians
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
• The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain
• The number of spanning trees in K_n-complement of a bipartite graph
• The sandpile model on the complete split graph, Motzkin words, and tiered parking functions

Cited in

(2)

• Enumeration of spanning trees containing a perfect matching in saturated non-covered graphs
• Two-round probabilistic diagnosis algorithm for fault identification

This page was built for publication: Resistance distance and spanning trees of generalized multiple complete split-like graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866673)