Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.12425

On the Total Regularity of Almost Mixed Moore Graphs

Ethan Shallcross
View original source ↗Read source document ↗Export metadata ↓

Abstract

The degree/diameter problem asks for the largest order of a graph with a given diameter and maximum vertex degree. This has been widely studied and given rise to a recent variation for mixed graphs (graphs with both undirected edges and directed arcs), where an additional bound is placed on the maximum directed out-degree of any vertex. Both problems have applications to network design. Counting the possible number of vertices at each distance from a given vertex gives a bound on the order of a mixed graph satisfying the degree and diameter constraints (the mixed Moore bound). In this paper, we settle an open problem posed by Tuite and Erskine concerning the total regularity of mixed graphs whose order is one less than the mixed Moore bound (almost mixed Moore graphs). We use this result to show that the three known almost mixed Moore graphs of diameter at least three are the only such mixed graphs.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ethan Shallcross. 2026-08-12. On the Total Regularity of Almost Mixed Moore Graphs. https://arxiv.org/abs/2608.12425

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↗