Resistance distances and the Moon-type formula of a vertex-weighted complete split graph
type: Item
instance of: scholarly article
title: Resistance distances and the Moon-type formula of a vertex-weighted complete split graph
author: Jun Ge
author: Yucui Liao
author: Bohan Zhang
published in: Discrete Applied Mathematics
publication date: 2024-11-06T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C22
zbMATH DE Number: 7939372
zbMATH Keywords: number of spanning trees
zbMATH Keywords: resistance distance
zbMATH Keywords: complete split graph
zbMATH Keywords: vertex-weighted graph
MaRDI profile type: MaRDI publication profile
cites work: Random walks and the effective resistance sum rules
cites work: Resistance distances in vertex-weighted complete multipartite graphs
cites work: Resistance distance local rules
cites work: Counting spanning trees in almost complete multipartite graphs
cites work: Complete split graph determined by its (signless) Laplacian spectrum
cites work: Counting spanning trees in a complete bipartite graph which contain a given spanning forest
cites work: Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
cites work: The sandpile model on the complete split graph, Motzkin words, and tiered parking functions
cites work: The number of spanning trees of the Bruhat graph
cites work: Effective resistances and spanning trees in the complete bipartite graph plus a matching
cites work: Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
cites work: The number of spanning trees in \(K_n\)-complement of a bipartite graph
cites work: A simple formula for the number of spanning trees of line graphs
cites work: Resistance between two nodes of a ring network
cites work: Rainbow matchings in edge-colored complete split graphs
cites work: Linear algebraic techniques for weighted spanning tree enumeration
cites work: The formulas for the number of spanning trees in circulant graphs
cites work: Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
cites work: Q4276003
cites work: The second moment of the complexity of a graph
cites work: Theory of resistor networks: the two-point resistance
cites work: On the number of spanning trees of some irregular line graphs
cites work: Two-point resistances and random walks on stellated regular graphs
cites work: Resistance between two vertices of almost complete bipartite graphs
cites work: The enumeration of spanning tree of weighted graphs
DOI: 10.1016/J.DAM.2024.07.040
description: scientific article; zbMATH DE number 7939372