Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:On distance magic labelings of Hamming graphs and folded hypercubes
Authors:ID Miklavič, Štefko (Author)
ID Šparl, Primož (Author)
Files:.pdf PDF - Presentation file, download (484,67 KB)
MD5: 414A1788ACBCBCE624F787C989A60DA3
 
URL URL - Source URL, visit https://www.dmgt.uz.zgora.pl/publish/article.php?doi=2430
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:Let $\Gamma = (V,E)$ be a graph of order $n$. A distance magic labeling of $\Gamma$ is a bijection $\ell \colon V \to \{1,2, \ldots, n\}$ for which there exists a positive integer $k$ such that $\sum_{x \in N(u)} \ell(x) = k$ for all vertices $u \in V$, where $N(u)$ is the neighborhood of $u$. A graph is said to be distance magic if it admits a distance magic labeling. The Hamming graph $\mathrm{H}(D,q)$, where $D, q$ are positive integers, is the graph whose vertex set consists of all words of length $D$ over an alphabet of size $q$ in which two vertices are adjacent whenever the corresponding words differ in precisely one position. The well-known hypercubes are precisely the Hamming graphs with $q = 2$. Distance magic hypercubes were classified in two papers from 2013 and 2016. In this paper we consider all Hamming graphs. We provide a sufficient condition for a Hamming graph to be distance magic and as a corollary provide an infinite number of pairs $(D, q)$ for which the corresponding Hamming graph $\mathrm{H}(D,q)$ is distance magic. A folded hypercube is a graph obtained from a hypercube by identifying pairs of vertices at maximal distance. We classify distance magic folded hypercubes by showing that the dimension-$D$ folded hypercube is distance magic if and only if $D$ is divisible by $4$.
Keywords:distance magic labeling, distance magic graph, Hamming graph, folded hypercube
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2024
Year of publishing:2024
Number of pages:str. 17-33
Numbering:Vol. 44, iss. 1
PID:20.500.12556/DiRROS-20503 New window
UDC:519.17
ISSN on article:1234-3099
DOI:10.7151/dmgt.2430 New window
COBISS.SI-ID:87398659 New window
Publication date in DiRROS:02.10.2024
Views:200
Downloads:86
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discussiones mathematicae : Graph theory
Shortened title:Discuss. Math., Graph Theory
Publisher:Technical University Press
ISSN:1234-3099
COBISS.SI-ID:7487065 New window

Document is financed by a project

Funder:ARRS - Slovenian Research Agency
Project number:P1-0285
Name:Algebra, diskretna matematika, verjetnostni račun in teorija iger

Funder:ARRS - Slovenian Research Agency
Project number:N1-0062
Name:Stopnja lihosti tranzitivnih permutacijskih grup

Funder:ARRS - Slovenian Research Agency
Project number:J1-9110
Name:Prehodnost v točkovno tranzitivnih grafih

Funder:ARRS - Slovenian Research Agency
Project number:J1-1695
Name:Razdaljno-regularni grafi: nerazcepni T-moduli s krajiščem 1 in delovanje grupe automorfizmov

Funder:ARRS - Slovenian Research Agency
Project number:N1-0140
Name:Geometrije, grafi, grupe in povezave med njimi

Funder:ARRS - Slovenian Research Agency
Project number:N1-0159
Name:Konstrukcija nekaterih diskretnih matematičnih objektov v spektralni domeni

Funder:ARRS - Slovenian Research Agency
Project number:J1-2451
Name:Simetrija na grafih preko rigidnih celic

Funder:ARRS - Slovenian Research Agency
Project number:N1-0208
Name:Avtomorfizmi in izomorfizmi končnih grafov

Funder:ARRS - Slovenian Research Agency
Project number:J1-9108
Name:Polregularni elementi v 2-zaprtjih rešljivih grup

Funder:ARRS - Slovenian Research Agency
Project number:J1-1694
Name:Načrtovanje določenih popolnih diskretnih kombinatoričnih objektov v spektralni domeni

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.

Secondary language

Language:Slovenian
Keywords:razdaljno magična labeliranja, razdaljno magični grafi, Hammingov graf, zložena hiperkocka


Back