Express the number of spanning trees in term of degrees
From MaRDI portal
Publication:2247149
DOI10.1016/J.AMC.2021.126697OpenAlexW3207865968WikidataQ112880135 ScholiaQ112880135MaRDI QIDQ2247149FDOQ2247149
Authors: 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
Recommendations
Cites Work
- A survey of the theory of hypercube graphs
- Title not available (Why is that?)
- A simple formula for the number of spanning trees of line graphs
- Spanning trees and orientation of graphs
- The Enumeration of Point Labelled Chromatic Graphs and Trees
- An Analysis of the Wang Algebra of Networks
- Graph-polynomials
- The second moment of the complexity of a graph
- Enumeration of spanning trees of middle graphs
- Expression for the number of spanning trees of line graphs of arbitrary connected graphs
- Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
Cited In (6)
- Counting spanning trees in a complete bipartite graph which contain a given spanning forest
- Enumeration of spanning trees of middle graphs
- Expression for the number of spanning trees of line graphs of arbitrary connected graphs
- Title not available (Why is that?)
- Express the number of spanning trees in term of degrees
- Title not available (Why is that?)
This page was built for publication: Express the number of spanning trees in term of degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2247149)