Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Headley, Patrick Thomas
Gannon University
Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
The distance magic property and two families of Cartesian product graphs Headley, Patrick Thomas
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2025.13.1.13

Abstract

Let G = G(V, E) be a simple graph. The graph G is said to be distance magic if there exists a bijection f : V → {1, 2, …, |V|} and a constant s such that Σy ∈ N(x)f(y)=s for all x ∈ V. In this paper we show that the only distance magic graph of the form Kn□Cm is K1□C4, and that m = 4 if Cm□Kn, t is distance magic. Necessary conditions are given for C4□Kn, t to be distance magic when n > t. These conditions are shown to be sufficient when n and t are both even. We conclude with some examples of distance magic graphs of the form C4□Kn, t with n > t, in particular constructing an infinite sequence of non-isomorphic distance magic graphs of this type.
Co-Authors