Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2412.10926

Well-edge-dominated graphs containing triangles

Jake Berg·Perryn Chang·Claire Kaneshiro·Kirsti Kuenzel·Ryan Pellico·Isabel Renteria·Sumi Vora
View original source ↗Read source document ↗Export metadata ↓

Abstract

A set of edges $F$ in a graph $G$ is an edge dominating set if every edge in $G$ is either in $F$ or shares a vertex with an edge in $F$. $G$ is said to be well-edge-dominated if all of its minimal edge dominating sets have the same cardinality. Recently it was shown that any triangle-free well-edge-dominated graph is either bipartite or in the set $\{C_5, C_7, C_7^*\}$ where $C_7^*$ is obtained from $C_7$ by adding a chord between any pair of vertices distance three apart. In this paper, we completely characterize all well-edge-dominated graphs containing exactly one triangle, of which there are two infinite families. We also prove that there are only eight well-edge-dominated outerplanar graphs, most of which contain at most one triangle.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jake Berg, Perryn Chang, Claire Kaneshiro, Kirsti Kuenzel, Ryan Pellico, Isabel Renteria, Sumi Vora. 2024-12-14. Well-edge-dominated graphs containing triangles. https://arxiv.org/abs/2412.10926

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↗