1. Group distance magic cubic graphsSylwia Cichacz, Štefko Miklavič, 2026, original scientific article 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
Published in RUP: 06.05.2026; Views: 431; Downloads: 6
 Full text (187,65 KB)
This document has more files! More... |
2. |
3. Odčitljivost digrafov in dvodelnih grafov : zaključna nalogaVladan Jovičić, 2016, undergraduate thesis Keywords: readability, overlap graph, labeling, integer linear program, distinctness, decomposition, HUB-number, two-dimensional grid graphs, toroidal grid graphs
Published in RUP: 09.08.2016; Views: 4375; Downloads: 54
 Link to full text
This document has more files! More... |
4. |
5. |
