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

DOI10.1007/S00034-025-03124-7MaRDI QIDQ6890131zbMATH OpenFDO

Authors Chenlin Yang, Tao Tian

Publication date 4 December 2025

Published in Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00034-025-03124-7

zbMATH Keywords

Laplacian spectrummultiple extended complete split-like graphresistance distancespanning trees

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• Central vertex join and central edge join of two graphs
• Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs
• 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
• Enumeration of spanning trees containing a perfect matching in linear polygonal chains
• Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink
• Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
• Integral complete split graphs
• Laplacian graph eigenvectors
• On $W$-bases of directed graphs
• On distance integral graphs
• On the resistance diameter of the Cartesian and lexicographic product of paths
• On the resistance distance and Kirchhoff index of K_n-chain(ring) network
• Resistance distance and Kirchhoff index in dihedral Cayley graphs
• Resistance distance and Kirchhoff index of \(R\)-vertex join and \(R\)-edge join of two graphs
• Resistance distance and Kirchhoff index of the Q-vertex (or edge) join graphs
• Resistance distance and Kirchhoff index of unbalanced blowups of graphs
• Resistance distance and spanning trees of multiple extended complete split-like graph
• Resistance distance in complete n-partite graphs
• Resistance distance in generalized core-satellite graphs
• 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 generalized join graphs
• Resistance distances in stretched Cantor product networks
• Resistance distances in vertex-weighted complete multipartite graphs
• Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs
• The number of spanning trees in K_n-complement of a bipartite graph
• The number of spanning trees of the Cartesian product of regular graphs

Cited in

(2)

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

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

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