Results 11 to 20 of about 2,192 (158)
D-magic strongly regular graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a set of distances D, a graph G on n vertices is said to be D-magic if there exists a bijection and a constant k such that for any vertex x, where is the D-neighbourhood set of x.
Rinovia Simanjuntak, Palton Anuwiksa
doaj +1 more source
Distance magic circulant graphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sylwia Cichacz, Dalibor Froncek
openaire +2 more sources
Note on group distance magicness on product graphs
Contributions to Discrete Mathematics, 2021 If $l$ is a bijection from the vertex set $V(G)$ of a graph $G$ to an additive abelian group $\Gamma$ of $|V(G)|$ elements such that for any vertex $u$ of $G$, the weight $\sum_{v\in N_{G}(u)}l(v)$ is $\mu$, where $\mu \in \Gamma$, then $l$ is a $\Gamma$-distance magic labeling of $G$.
Prajeesh, Appattu Vallapil +1 more
openaire +2 more sources
Handicap Labelings of 4-Regular Graphs
Advances in Electrical and Electronic Engineering, 2017 Let G be a simple graph, let f : V(G)→{1,2,...,|V(G)|} be a bijective mapping. The weight of v ∈ V(G) is the sum of labels of all vertices adjacent to v. We say that f is a distance magic labeling of G if the weight of every vertex is the same
Petr Kovar +3 more
doaj +1 more source
On the uniqueness of d-vertex magic constant
Discussiones Mathematicae Graph Theory, 2014 Let G = (V,E) be a graph of order n and let D ⊆ {0, 1, 2, 3, . . .}. For v ∈ V, let ND(v) = {u ∈ V : d(u, v) ∈ D}. The graph G is said to be D-vertex magic if there exists a bijection f : V (G) → {1, 2, . . .
Arumugam S. +2 more
doaj +1 more source
Distance Magic Labeling and Two Products of Graphs [PDF]
Graphs and Combinatorics, 2014 Let $G=(V,E)$ be a graph of order $n$. A distance magic labeling of $G$ is a bijection $\ell \colon V\rightarrow {1,...,n}$ for which there exists a positive integer $k$ such that $\sum_{x\in N(v)}\ell (x)=k$ for all $v\in V $, where $N(v)$ is the neighborhood of $v$. We introduce a natural subclass of distance magic graphs. For this class we show that
Anholcer, Marcin +3 more
openaire +3 more sources
Classification of tetravalent distance magic circulant graphs
Discrete Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Štefko Miklavič, Primož Šparl
openaire +1 more source
Note on Group Distance Magic Graphs G[C 4] [PDF]
Graphs and Combinatorics, 2013 A \emph{group distance magic labeling} or a $\gr$-distance magic labeling of a graph $G(V,E)$ with $|V | = n$ is an injection $f$ from $V$ to an Abelian group $\gr$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every vertex $x \in V$ is equal to the same element $ \in \gr$, called the magic constant.
openaire +2 more sources
On Distance Magic Harary Graphs
, 2018 This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distance magicness of legicographic product and direct product of G with C4, for every non-regular distance magic graph G with maximum degree |V(G)|-1.
Prajeesh, A V, Paramasivam, Krishnan
openaire +2 more sources
Distance Magic Index One Graphs
, 2018 14pages
Prajeesh, A V, Paramasivam, Krishnan
openaire +2 more sources