Publication:6633516

DOI10.1016/J.DAM.2024.07.040MaRDI QIDQ6633516FDOQ6633516

Jun Ge, Bohan Zhang, Yucui Liao

Publication date: 6 November 2024

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

zbMATH Keywords

complete split graphresistance distancenumber of spanning treesvertex-weighted graph

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Signed and weighted graphs (05C22) Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• Complete split graph determined by its (signless) Laplacian spectrum
• The formulas for the number of spanning trees in circulant graphs
• A simple formula for the number of spanning trees of line graphs
• Random walks and the effective resistance sum rules
• Resistance distance local rules
• Resistance distances in vertex-weighted complete multipartite graphs
• Theory of resistor networks: the two-point resistance
• On the number of spanning trees of some irregular line graphs
• The enumeration of spanning tree of weighted graphs
• Rainbow matchings in edge-colored complete split graphs
• Linear algebraic techniques for weighted spanning tree enumeration
• The second moment of the complexity of a graph
• The number of spanning trees of the Bruhat graph
• Counting spanning trees in almost complete multipartite graphs
• Resistance between two vertices of almost complete bipartite graphs
• Resistance between two nodes of a ring network
• Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
• Two-point resistances and random walks on stellated regular graphs
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
• Effective resistances and spanning trees in the complete bipartite graph plus a matching
• The sandpile model on the complete split graph, Motzkin words, and tiered parking functions
• Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
• Counting spanning trees in a complete bipartite graph which contain a given spanning forest
• The number of spanning trees in \(K_n\)-complement of a bipartite graph

Cited In (1)

• Resistance distances in generalized join graphs

This page was built for publication: Resistance distances and the Moon-type formula of a vertex-weighted complete split graph

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