Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1103.0516

Pegging Numbers For Various Tree Graphs

Ariel Levavi
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the game of pegging, each vertex of a graph is considered a hole into which a peg can be placed. A pegging move is performed by jumping one peg over another peg, and then removing the peg that has been jumped over from the graph. We define the pegging number as the smallest number of pegs needed to reach all the vertices in a graph no matter what the distribution. Similarly, the optimal-pegging number of a graph is defined as the smallest distribution of pegs for which all the vertices in the graph can be reached. We obtain tight bounds on the pegging numbers and optimal-pegging numbers of complete binary trees and compute the optimal-pegging numbers of complete infinitary trees. As a result of these computations, we deduce that there is a tree whose optimal-pegging number is strictly increased by removing a leaf. We also compute the optimal-pegging number of caterpillar graphs and the tightest upper bound on the optimal-pegging numbers of lobster graphs.

Explore related subjects

math.COcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ariel Levavi. 2011-03-02. Pegging Numbers For Various Tree Graphs. https://arxiv.org/abs/1103.0516

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↗