Counting spanning trees of multiple complete split-like graph containing a given spanning forest

DOI10.1016/j.disc.2024.114300MaRDI QIDQ6646419

Chenlin Yang, Tao Tian

Publication date: 2 December 2024

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

zbMATH Keywords

spanning treeweighted graphcomplete split graphspanning forestmultiple complete split-like graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Complete split graph determined by its (signless) Laplacian spectrum
• Anti-Ramsey numbers in complete split graphs
• Determinant identities for Laplace matrices
• A theorem on trees.
• Rainbow matchings in edge-colored complete split graphs
• Dimers on a simple-quartic net with a vacancy
• The enumeration of spanning tree of weighted graphs
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
• The sandpile model on the complete split graph, Motzkin words, and tiered parking functions
• On $W$-bases of directed graphs
• Integral complete split graphs
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
• Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
• The second moment of the complexity of a graph
• Counting spanning trees in a complete bipartite graph which contain a given spanning forest
• Counting spanning trees with a Kekulé structure in linear hexagonal chains
• On distance Laplacian energy in terms of graph invariants
• Oriented spanning trees and stationary distribution of digraphs
• Counting spanning trees of \((1, N\))-periodic graphs

This page was built for publication: Counting spanning trees of multiple complete split-like graph containing a given spanning forest