Results 151 to 160 of about 2,130,896 (179)
Matrices Associated with D-Distance Magic Graphs and Their Properties
Cybernetics and Systems Analysis, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semeniuta, M., Shulhin, V.
exaly +4 more sources
Distance magic circulant graphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sylwia Cichacz, Dalibor Fronček
exaly +4 more sources
Classification of tetravalent distance magic circulant graphs
Discrete Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Primoz Šparl, Stefko Miklavic
exaly +2 more sources
A note on Distance Magic and Distance antimagic graphs
Electronic Notes in Discrete Mathematics, 2015 Abstract Let G = ( V , E ) be a graph of order n. The graph G is said to be distance magic if there exists a bijection f : V ( G ) → { 1 , 2 , … , n } such that for all v ∈ V , w ( v ) = ∑ u ∈ N ( v ) f ( u ) is a constant, called vertex magic constant.
Subramanian Arumugam, A Ramalakshmi
exaly +3 more sources
Spectra of graphs and closed distance magic labelings
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 +2 more
exaly +3 more sources
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
Marcin Anholcer +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Nearly Distance Magic Graphs
Lecture Notes in Computer Science, 2017Let \(G=(V,E)\) be a graph on n vertices. A bijection \(f: V \rightarrow \{1,2,\ldots , n\}\) is called a nearly distance magic labeling of G if there exists a positive integer k such that \(\sum _{x \in N(v)} f(x)=k \ or \ k+1\) for every \(v \in V\). The constant k is called a magic constant of the graph and any graph which admits such a labeling is ...
Aloysius Godinho
exaly +2 more sources
Group distance magic and antimagic graphs [PDF]
Electronic Notes in Discrete Mathematics, 2015 Final ...
Sanming Zhou +2 more
exaly +4 more sources
Symmetry, 2021 In this paper, we define D-magic labelings for oriented graphs where D is a distance set. In particular, we label the vertices of the graph with distinct integers {1,2,…,|V(G)|} in such a way that the sum of all the vertex labels that are a ...
Alison Marr, Rinovia Simanjuntak
exaly +2 more sources