Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.18172

On the Relationships between Domination, Isolation, and Packing

Geoffrey Boyer·Wayne Goddard·Michael A. Henning
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the relationships between the domination number of graph, denoted $γ$, and the distance-$2$ domination number, denoted $γ_2$, and three parameters that lie between them: the packing number, denoted $ρ$, the lower packing number, denoted $ρ_L$, and the isolation number, denoted $ι$. There has been recent attention on the question of whether $γ/ρ$ is bounded or unbounded for various families of graphs. We consider similar questions for the ratios of the five parameters. In particular we show that, while $γ/ρ_L$ is unbounded in trees, it holds that $ι/γ_2$ is less than $2$ for all trees. Further, $γ/ρ_L$ is at most $3$ in interval graphs, at most~$4$ in permutation graphs, and at most $5$ in general asteroidal-triple-free graphs. We also show that every tree has a set of vertices that is both isolating and a packing, and characterize trees where $ρ=ρ_L$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Geoffrey Boyer, Wayne Goddard, Michael A. Henning. 2026-06-16. On the Relationships between Domination, Isolation, and Packing. https://arxiv.org/abs/2606.18172

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↗