Results 11 to 20 of about 37,872 (210)

Distance Magic Labeling of Corona Product of Graphs

InPrime: Indonesian Journal of Pure and Applied Mathematics
Let G = (V, E) is a graph with order n, and f: V(G) → {1,2,...,n} is a bijection. For any vertex v ϵ V, the sum of f(u) is called the weight of vertex v, denoted by w(v), where N(v)  is the set of neighbors of vertex v.
Christyan Tamaro Nadeak
semanticscholar   +4 more sources

Distance magic labelling of Mycielskian graphs [PDF]

Electronic Journal of Graph Theory and Applications
A graph G = ( V, E ) , where | V ( G ) | = n and | E ( G ) | = m is said to be a distance magic graph if there is a bijection f : V ( G ) → { 1 , 2 , . . .
Ravindra Kuber Pawar, T. C. N. SINGH
semanticscholar   +3 more sources

Distance magic labeling on shadow graphs [PDF]

AIP Conference Proceedings, 2022
C. Subin Krishna, Shankaran Perikamana
semanticscholar   +3 more sources

Distance Magic Labeling in Complete 4-partite Graphs [PDF]

Graphs and Combinatorics, 2015
Let G be a complete k-partite simple undirected graph with parts of sizes $$p_1\le p_2\cdots \le p_k$$p1≤p2⋯≤pk. Let $$P_j=\sum _{i=1}^jp_i$$Pj=∑i=1jpi for $$j=1,\ldots ,k$$j=1,…,k.
Daniel Kotlar
semanticscholar   +6 more sources

Investigating Distance Magic Labeling In Mycielskian Graphs: Properties And Patterns

Acta Scientiae
Dr. Arunkumar. N. Yalal, Dr. Ashok Vangeri
semanticscholar   +4 more sources

Distance Magic Labeling of Generalised Mycielskian Graphs [PDF]

, 2023
In this paper, we have studied the distance magic labelling of Generalised Mycielskian of a few families of graphs.
Ravindra Pawar, Tarkehswar Singh
openalex   +3 more sources

Distance magic labelings of product graphs [PDF]

, 2017
21 pages, the Second Malta Conference in Graph Theory and ...
Rinovia Simanjuntak, I Wayan Palton Anuwiksa   +1 more
openalex   +3 more sources

Orientable Group Distance Magic Labeling of Directed Graphs [PDF]

Mathematical Problems in Engineering, 2022
A directed graph G is said to have the orientable group distance magic labeling if there exists an abelian group ℋ and one-one map ...
Wasim Ashraf, Hani Shaker, Muhammad Imran   +2 more
openalex   +2 more sources

Magic labelings of distance at most 2 [PDF]

, 2013
For an arbitrary set of distances $D\subseteq \{0,1, \ldots, d\}$, a graph $G$ is said to be $D$-distance magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots , v\}$ and a constant {\sf k} such that for any vertex $x$, $\sum_{y\in N_D(x)} f(y) ={\sf k}$, where $N_D(x) = \{y \in V| d(x,y) \in D\}$.
Rinovia Simanjuntak, Mona Elviyenti, Mohammad Nafie Jauhari, Alfan Sukmana Praja, Ira Apni Purwasih   +4 more
openalex   +3 more sources

Spectra of graphs and closed distance magic labelings [PDF]

Discrete Mathematics, 2016
Let $G=(V,E)$ be a graph of order $n$. A closed distance magic labeling of $G$ is a bijection $\ell \colon V(G)\rightarrow \{1,\ldots ,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 closed neighborhood of $v$.
Marcin Anholcer, Sylwia Cichacz, Iztok Peterin   +2 more
openalex   +3 more sources