Express the number of spanning trees in term of degrees

DOI10.1016/j.amc.2021.126697OpenAlexW3207865968WikidataQ112880135 ScholiaQ112880135MaRDI QIDQ2247149

Yanyan Li

Publication date: 16 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.07871

zbMATH Keywords

degreespanning treegraph polynomial

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items

Counting spanning trees in a complete bipartite graph which contain a given spanning forest

Cites Work

• Unnamed Item
• Spanning trees and orientation of graphs
• A survey of the theory of hypercube graphs
• Graph-polynomials
• Enumeration of spanning trees of middle graphs
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
• The Enumeration of Point Labelled Chromatic Graphs and Trees
• A simple formula for the number of spanning trees of line graphs
• Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
• The second moment of the complexity of a graph
• An Analysis of the Wang Algebra of Networks