Group distance magic labeling of the Cartesian product of two directed cycles

Let $ \overrightarrow{G} $ be a finite simple directed graph with $ n $ vertices, and let $ \Gamma $ be a finite abelian group of order $ n $. A $ \Gamma $-distance magic labeling is a bijection $ \varphi:V(\overrightarrow{G})\longrightarrow \Gamma $ for which there exists $ c\in\Gamma $ such that $ \sum_{y\in N^+(x)}\varphi(y)-\sum_{y\in N^-(x)}\varphi(y) = c $ for any $ x\in V(\overrightarrow{G}) $, where $ N^+(x) $ and $ N^-(x) $ denote the set of the head and the tail of $ x $, respectively. In this paper, we obtain a necessary and sufficient condition for that there exists a $ \Gamma $-distance magic labeling for the Cartesian products of two directed cycles.

Authors

Institutions

Publication Details

Journal
Electronic Research Archive
Published
2025-01-01
DOI
https://doi.org/10.3934/era.2025178
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Group distance magic labeling of the Cartesian product of two directed cycles

Caimei Luo, Yan Li, Guixin Deng
Electronic Research Archive
Graph Labeling and Dimension Problems
article

Group distance magic labeling of the Cartesian product of two directed cycles

Caimei Luo, Yan Li, Guixin Deng
article en

Abstract

Let $ \overrightarrow{G} $ be a finite simple directed graph with $ n $ vertices, and let $ \Gamma $ be a finite abelian group of order $ n $. A $ \Gamma $-distance magic labeling is a bijection $ \varphi:V(\overrightarrow{G})\longrightarrow \Gamma $ for which there exists $ c\in\Gamma $ such that $ \sum_{y\in N^+(x)}\varphi(y)-\sum_{y\in N^-(x)}\varphi(y) = c $ for any $ x\in V(\overrightarrow{G}) $, where $ N^+(x) $ and $ N^-(x) $ denote the set of the head and the tail of $ x $, respectively. In this paper, we obtain a necessary and sufficient condition for that there exists a $ \Gamma $-distance magic labeling for the Cartesian products of two directed cycles.

Electronic Research ArchiveVol. 33(6)
Nanning Normal University (CN)
Openalex Percentile: Top 84%
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Group distance magic labeling of the Cartesian product of two directed cycles — Caimei Luo, Yan Li, et al. · Electronic Research Archive (2025) | TGRS Research Map | TGRS