On two conjectures concerning spanning tree edge dependences of graphs

DOI10.1016/J.DAM.2023.11.012MaRDI QIDQ6180563zbMATH OpenOpenAlexFDO

Authors Yujun Yang, Can Xu

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

zbMATH Keywords

resistance distancespanning treedual graphspanning tree edge densityspanning tree edge dependence

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Structural characterization of families of graphs (05C75) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On constructing rational spanning tree edge densities
• scientific article; zbMATH DE number 1933253
• Spanning trees and orientation of graphs
• scientific article; zbMATH DE number 4112610
• Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs

Cites work

• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 1933253 (Why is no real title available?)
• scientific article; zbMATH DE number 3198646 (Why is no real title available?)
• scientific article; zbMATH DE number 3061533 (Why is no real title available?)
• A simple formula for the number of spanning trees of line graphs
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Counting spanning trees of a type of generalized Farey graphs
• Enumeration of spanning trees of 2-separable networks
• Enumeration of spanning trees of graphs with rotational symmetry
• Expression for the number of spanning trees of line graphs of arbitrary connected graphs
• Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
• On $W$-bases of directed graphs
• On constructing rational spanning tree edge densities
• On the number of spanning trees in directed circulant graphs
• On the number of spanning trees of \(K^m_n \pm G\) graphs
• On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
• On the number of spanning trees of multi-star related graphs
• On the number of spanning trees of some irregular line graphs
• Resistances and currents in infinite electrical networks
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
• Spanning trees of 3-uniform hypergraphs
• The Enumeration of Point Labelled Chromatic Graphs and Trees
• The asymptotic number of spanning trees in circulant graphs
• The formulas for the number of spanning trees in circulant graphs
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• The number of spanning trees in circulant graphs
• The number of spanning trees in odd valent circulant graphs
• The number of spanning trees of a class of self-similar fractal models
• The number of spanning trees of a complete multipartite graph
• The number of spanning trees of the Bruhat graph
• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)

Cited in

(4)

• On saturated non-covered graphs
• Counting matchable spanning trees of join graphs
• On a conjecture regarding spanning tree edge dependences of planar graphs
• Bounds on the resistance distance and Kirchhoff index of graphs

This page was built for publication: On two conjectures concerning spanning tree edge dependences of graphs

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