Search arXiv⌕ Search

arXiv · 2611.10196

Questions of minimality for DDMOGs and cycle ornaments

Abstract

Difference distance magic oriented graphs (DDMOGs) are oriented graphs whose vertices admit a bijective labeling by consecutive positive integers such that every vertex has weight zero, where the weight is the sum of the labels of its in-neighbors minus the sum of the labels of its out-neighbors. We investigate minimality and sparsity questions for DDMOGs and their ornaments. First, we develop new constructions of cycle-based ornaments that reduce the number of cycles required for a given number of attachment nodes and identify minimal cycle lengths in several cases. Second, we determine the minimum number of arcs in a nontrivial DDMOG of order $n$, combining computational enumeration for small orders with theoretical lower bounds and constructions. Langford sequences provide a key tool in these constructions, enabling us to partition consecutive labels into difference triples and thereby construct sparse DDMOGs. Finally, we use related constructions to obtain generalized ornaments with no internal arcs. These results advance the study of minimal constructions in difference distance magic labeling and provide new methods for building sparse DDMOGs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Roza Aceska, McKailyn Lort, Allison Ripperger, Zach Wilcher. 2026-11-06. Questions of minimality for DDMOGs and cycle ornaments. https://arxiv.org/abs/2611.10196

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The finite volume method on Sierpiński simplices

In the sequel, we extend the Strichartz average approach for the Laplacian, which uses average values of a function over basic sets, rather than pointwise ones as classically done in the literature, and goes back to the seminal work of~S.~Kusuoka and~X.~Y.~Zhou, to Sierpiński Simplices. To our knowledge, the finite volume method had not been applied before to fractals themselves, with their intrinsic Laplacian. We build the finite volume scheme for the heat equation with Dirichlet boundary conditions, give its consistency error, a stability condition of Courant-Friedrichs-Lewy type, obtained by means of an inclusion between the spectrum of the finite volume matrix and the one of the graph Laplacian, and prove the convergence of the scheme. Numerical results are given in the case of the Sierpiński Gasket and Tetrahedron, and compared with the finite difference method.

math.CO↗

Absolute incidence theorems and tilings

We give a precise definition of incidence theorems in plane projective geometry and introduce the notion of absolute incidence theorems, which hold over any ring. Fomin and Pylyavskyy describe how to obtain incidence theorems from tilings of an orientable surface; they call this result the master theorem. Instances of the master theorem are always absolute incidence theorems. As most classically known incidence theorems are instances of the master theorem, they are absolute incidence theorems. We give an explicit example of an incidence theorem involving 13 points that is not an absolute incidence theorem, and therefore is not an instance of the master theorem.

math.CO↗

Cyclic sieving phenomena for trees and tree-rooted maps

We prove cyclic sieving phenomena satisfied by corner-rooted plane trees (alias ordered trees). The sets of rooted plane trees that we consider are: (1) all trees with $n$ nodes; (2) all trees with $n$ nodes and $k$ leaves; (3) all trees with a given degree distribution of the nodes. Moreover, we consider four different cyclic group actions: (1) the root is moved to the next corner along a tour of the tree; (2) only trees in which the root is at a leaf are considered, and the action moves the root to the next leaf; (3) only trees in which the root is at a non-leaf are considered, and the action moves the root to the next non-leaf corner; (4) only trees in which the root is at a node of degree $δ$ are considered, for a fixed $δ$, and the action moves the root to the next corner of this type. We prove a cyclic sieving phenomenon for each meaningful combination of these sets and actions. As a bonus, we also establish corresponding cyclic sieving phenomena for tree-rooted planar maps.

math.CO↗