| Title: | Group distance magic cubic graphs |
|---|
| Authors: | ID Cichacz, Sylwia (Author)
ID Miklavič, Štefko (Author) |
|---|
| Files: |  RAZ_Cichacz_Sylwia_2026.pdf (187,65 KB)
MD5: 235681C4C421F0BD6A4570873F31A729
 https://www.dmgt.uz.zgora.pl/publish/article.php?doi=2613
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | IAM - Andrej Marušič Institute
|
|---|
| Abstract: | A $\Gamma$-distance magic labeling of a graph $G = (V, E)$ with $|V| = n$ is a bijection $\ell$ from $V$ to an Abelian group $\Gamma$ of order $n$, for which there exists $\mu \in \Gamma$, such that the weight $w(x) =\sum_{y\in N(x)}\ell(y)$ of every vertex $x \in V$ is equal to $\mu$. In this case, the element $\mu$ is called the magic constant of $G$. A graph $G$ is called a group distance magic if there exists a $\Gamma$-distance magic labeling of $G$ for every Abelian group $\Gamma$ of order $n$. In this paper, we focused on cubic $\Gamma$-distance magic graphs as well as some properties of such graphs. |
|---|
| Keywords: | group distance magic labeling, Kotzig array, generalized Petersen graph |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 22.12.2025 |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | str. 465-481 |
|---|
| Numbering: | Vol. 46, no. 2 |
|---|
| PID: | 20.500.12556/RUP-23023  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 1234-3099 |
|---|
| DOI: | 10.7151/dmgt.2613 |
|---|
| COBISS.SI-ID: | 277277443 |
|---|
| Publication date in RUP: | 06.05.2026 |
|---|
| Views: | 36 |
|---|
| Downloads: | 2 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
