Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.01616

On graphs having one size of maximal open packings

Bert L. Hartnell·Douglas F. Rall
View original source ↗Read source document ↗Export metadata ↓

Abstract

A set $P$ of vertices in a graph $G$ is an open packing if no two distinct vertices in $P$ have a common neighbor. Among all maximal open packings in $G$, the smallest cardinality is denoted $ρ^{\rm o}_L(G)$ and the largest cardinality is $ρ^{\rm o}(G)$. There exist graphs for which these two invariants are arbitrarily far apart. In this paper we begin the investigation of the class of graphs that have one size of maximal open packings. By presenting a method of constructing such graphs we show that every graph is the induced subgraph of a graph in this class. The main result of the paper is a structural characterization of those $G$ that do not have a cycle of order less than $15$ and for which $ρ^{\rm o}_L(G)=ρ^{\rm o}(G)$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bert L. Hartnell, Douglas F. Rall. 2020-06-02. On graphs having one size of maximal open packings. https://arxiv.org/abs/2006.01616

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↗