On a conjecture regarding spanning tree edge dependences of planar graphs

DOI10.1016/J.DAM.2025.10.021MaRDI QIDQ6883373zbMATH OpenFDO

Authors Jing Gao, Wensheng Sun, Yujun Yang

Publication date 16 December 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.10.021

zbMATH Keywords

necklace graphresistance distancespanning treespanning 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)

Cites work

• A simple formula for the number of spanning trees of line graphs
• A theorem on trees.
• A variant of the Teufl-Wagner formula and applications
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Counting spanning trees in a complete bipartite graph which contain a given spanning forest
• Counting spanning trees of a type of generalized Farey graphs
• Counting spanning trees with a Kekulé structure in linear hexagonal chains
• Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink
• Enumeration of spanning trees of 2-separable networks
• Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
• Enumeration of spanning trees of graphs with rotational symmetry
• Equiarboreal graphs
• Expression for the number of spanning trees of line graphs of arbitrary connected graphs
• scientific article; zbMATH DE number 1933253 (Why is no real title available?)
• scientific article; zbMATH DE number 3198646 (Why is no real title available?)
• Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal 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
• On two conjectures concerning spanning tree edge dependences of graphs
• Resistance characterizations of equiarboreal graphs
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• The asymptotic number of spanning trees in circulant graphs
• The Enumeration of Point Labelled Chromatic Graphs and Trees
• 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 numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)

This page was built for publication: On a conjecture regarding spanning tree edge dependences of planar graphs

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