Indexed metadata

Antimagic Labeling of Central Digraphs Constructed from Loops

Raja Rawat

Source record

Source: arXiv

Published: Oct 26, 2026

arXiv: 2610.35419

Open original source ↗

Source abstract

Let (T,∘)(T, \circ) be a loop of order k≥3k \geq 3 and DS∗D_S^* the loopless central digraph obtained from the associated central digraph DSD_S by removing the kk self-loops at the diagonal vertices. We construct an explicit arc-labeling ff of DS∗D_S^* ordering all arcs lexicographically by (tail,head)(\text{tail}, \text{head}) and assigning labels 1,…,m1, \ldots, m in that order and prove that ff is an antimagic labeling. Consequently, DSD_S is antimagic for every loop of order k≥3k \geq 3, a property that depends only on kk and is invariant across all non-isomorphic loops of the same order.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.