Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1009.2060

Ranking and unranking trees with a given number or a given set of leaves

Jeffrey B. Remmel·S. Gill Williamson
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we provide algorithms to rank and unrank certain degree-restricted classes of Cayley trees (spanning trees of the n-vertex complete graph). Specifically, we consider classes of trees that have a given set of leaves or a fixed number k of leaves. For fixed k, the number of Cayley trees with n vertices and k leaves grows roughly as n! and hence the ranks have O(nlog_2(n)) bits. Our ranking and unranking algorithms require at most O(n^2) comparisons of numbers less than or equal to n plus O(n) operations of multiplication, division, addition, substraction and comparision on numbers of length O(nlog(n)).

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeffrey B. Remmel, S. Gill Williamson. 2010-09-10. Ranking and unranking trees with a given number or a given set of leaves. https://arxiv.org/abs/1009.2060

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗