On two conjectures concerning spanning tree edge dependences of graphs
From MaRDI portal
Publication:6180563
DOI10.1016/j.dam.2023.11.012zbMath1529.05040OpenAlexW4388550248MaRDI QIDQ6180563
Publication date: 22 December 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.11.012
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of spanning trees of multi-star related graphs
- On constructing rational spanning tree edge densities
- The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
- Spanning trees of 3-uniform hypergraphs
- On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
- Resistances and currents in infinite electrical networks
- The asymptotic number of spanning trees in circulant graphs
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
- The number of spanning trees of a complete multipartite graph
- The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
- The number of spanning trees in circulant graphs
- The number of spanning trees of a class of self-similar fractal models
- The number of spanning trees in odd valent circulant graphs
- The number of spanning trees of the Bruhat graph
- Counting spanning trees of a type of generalized Farey graphs
- Enumeration of spanning trees of 2-separable networks
- Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
- On the number of spanning trees of some irregular line graphs
- The formulas for the number of spanning trees in circulant graphs
- Enumeration of spanning trees of graphs with rotational symmetry
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- On the number of spanning trees in directed circulant graphs
- On $W$-bases of directed 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