Cover Image

The average distance of spanning trees in terms of independence number

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Du, Zhibin, Qi, Xuli
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On distance spectral radius of power hypertrees with given number of pendant paths of fixed length
by: Wang, Yanna, et al.
Published: (2026)

Fan's condition for completely independent spanning trees
by: Ma, Jie, et al.
Published: (2025)

On the minimum number of maximal distance-$k$ independent sets in trees
by: Taletskii, Dmitrii
Published: (2026)

On the number of distinct spanning trees in pseudorandom graphs
by: Wang, Yiting
Published: (2026)

Almost spanning distance trees in subsets of finite vector spaces
by: Chakraborti, Debsoumya, et al.
Published: (2023)

On the number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

Enumeration of spanning trees and resistance distances of generalized blow-up graphs
by: Liu, Hechao, et al.
Published: (2025)

On the Hilton-Zhao vertex-splitting conjecture
by: Qi, Xuli, et al.
Published: (2026)

The spanning number and the independence number of a subset of an abelian group
by: Bajnok, Bela
Published: (2024)

Revisiting $d$-distance (independent) domination in trees and in bipartite graphs
by: Bujtás, Csilla, et al.
Published: (2025)

The number of trees in distance-hereditary graphs and their friends
by: Cherkashin, Danila, et al.
Published: (2024)

On the number of spanning trees of bicirculant graphs
by: Yang, Jing, et al.
Published: (2026)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

Random choice spanning trees
by: Archer, Eleanor, et al.
Published: (2024)

Maximum spanning trees in normed planes
by: Alonso, Javier, et al.
Published: (2026)

The enumeration of odd spanning trees in graphs
by: Xu, Shaohan, et al.
Published: (2026)

On the size of universal graphs for spanning trees
by: Kim, Jaehoon, et al.
Published: (2025)

Discrepancies of spanning trees in dense graphs
by: Hollom, Lawrence, et al.
Published: (2024)

A new improvement to the Overfull Conjecture
by: Qi, Xuli, et al.
Published: (2025)

Lower bounds on the independence numbers of distance graphs with vertices in $\{-1, 0, 1\}^n$
by: Akhiiarov, A. R., et al.
Published: (2024)

Induced matching treewidth and tree-independence number, revisited
by: Alon, Noga, et al.
Published: (2025)

The $d$-distance $p$-packing domination number: complexity, cycles, and trees
by: Bujtás, Csilla, et al.
Published: (2025)

Construction of infinitely many trace-minimal graphs with maximum number of spanning trees
by: Romero, Pablo, et al.
Published: (2025)

Perfect matchings and spanning trees: squarishness, bijections and independence
by: Byun, Seok Hyun, et al.
Published: (2024)

Semidegree threshold for spanning trees in oriented graphs
by: Araújo, Pedro, et al.
Published: (2026)

The Ferrers bound for spanning trees in bipartite graphs
by: Ho, Boon Suan
Published: (2026)

An exact-arithmetic algorithm for spanning tree modulus
by: Albin, Nathan, et al.
Published: (2020)

A short note on spanning even trees
by: Ai, Jiangdong, et al.
Published: (2024)

Effective resistance and spanning trees in complete graphs with distance-class deletions
by: Tamura, Shunya
Published: (2026)

Sufficient conditions for spanning $k$-trees in tough graphs
by: Jia, Caili, et al.
Published: (2026)

Bounded-degree spanning trees in randomly perturbed graphs
by: Krivelevich, Michael, et al.
Published: (2015)

On the random minimum edge-disjoint spanning trees problem
by: Shabanov, Dmitry, et al.
Published: (2025)

Partitions of complete twisted graphs into plane spanning trees
by: Figueroa, Ana Paulina, et al.
Published: (2025)

The spanning tree spectrum: improved bounds and simple proofs
by: Alon, Noga, et al.
Published: (2025)

Partial sampling of a random spanning tree
by: Jan, Yves Le
Published: (2025)

The minimum number of maximal independent sets in graphs with given order and independence number
by: Tian, Yuting, et al.
Published: (2024)

A stability theorem for embedding bounded degree spanning trees
by: Csaba, Béla
Published: (2026)

Random Turán theorem for expansions of spanning subgraphs of tight trees
by: Nie, Jiaxi
Published: (2023)

Color-avoiding connected spanning subgraphs with minimum number of edges
by: Pintér, József, et al.
Published: (2023)

Anticoncentration of random spanning trees in almost regular graphs
by: Lee, Hyunwoo
Published: (2026)