Results 11 to 20 of about 10,794,216 (210)
On Group-Vertex-Magic Labeling of Simple Graphs [PDF]
, 2023 Let A be an Abelian group with identity 0. The A-vertex-magic labeling of a graph G is a mapping from the set of vertices in G to A-{0} such that the sum of the labels of every open neighborhood vertex of v is equal, for every vertex v in G.
Vira Hari Krisnawati +2 more
core +1 more source
Orientable Z_n-distance Magic Labeling of the Cartesian Product of Many Cycles [PDF]
, 2017 The following generalization of distance magic graphs was introduced in [2]. A directed Z_n-distance magic labeling of an oriented graph $\overrightarrow{G}=(V,A)$ of order n is a bijection $\overrightarrow{\ell}\colon V \rightarrow Z_n$ with the ...
Freyberg, B. (Bryan) +5 more
core +1 more source
A SURVEY OF DISTANCE MAGIC GRAPHS [PDF]
, 2014 In this report, we survey results on distance magic graphs and some closely related graphs. A distance magic labeling of a graph G with magic constant k is a bijection l from the vertex set to {1, 2, . . .
Rupnow, Rachel
core +1 more source
Note on group distance magicness on product graphs [PDF]
, 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$-
Paramasivam, Krishnan +1 more
core +1 more source
Total Neighborhood Magic Labeling: A New Variant of Magic Labeling
, 2021 In this paper, we introduce a total neighborhood magic labeling, which is a variant of magic labeling.
N P Shrimali, Y M Parmar
core +1 more source
Union of Distance Magic Graphs [PDF]
, 2017 A distance magic labeling of a graph $G = (V,E)$ with $|V | = n$ is a bijection $ \mathcal{l} $ from $V$ to the set ${1, . . ., n}$ such that the weight $ w(x) = \Sigma_{ y \in N_G } (x) \mathcal{l}(y) $ of every vertex $ x \in V $ is equal to the same ...
Cichacz, Sylwia, Nikodem, Mateusz
core +2 more sources
Distance magic-type and distance antimagic-type labelings of graphs [PDF]
, 2017 Generally speaking, a distance magic-type labeling of a graph G of order n is a bijection f from the vertex set of the graph to the first n natural numbers or to the elements of a group of order n, with the property that the weight of each vertex is the ...
Freyberg, Bryan
core +1 more source
On distance magic circulants of valency 6 [PDF]
, 2022 A graph $Γ= (V,E)$ of order $n$ is {\em distance magic} if it admits a bijective labeling $\ell \colon V \to \{1,2, \ldots, n\}$ of its vertices for which there exists a positive integer $κ$ such that $\sum_{u \in N(v)} \ell(u) = κ$ for all vertices $v ...
Miklavič, Štefko, Šparl, Primož
core +1 more source
On group labeling of some graphs [PDF]
, 2020 Исследованы групповые разметки магического и антимагического типов. Установлена взаимосвязь между ними для графа и его дополнения. Введено понятие закрытой групповой дистанционной магической разметки.
Семенюта, М.Ф. +1 more
core +1 more source
Pyridinium Cations Act as Charge Reservoirs in Expanded Halide Perovskite Analogs at High Pressure
Angewandte Chemie, EarlyView.Redox‐innocent pyridinium derivatives can act as charge reservoirs in expanded tin‐iodide perovskite analogs. Material compression reduces the energy gap between the pyridinium π* acceptor orbital and the valence‐band maximum, facilitating electron transfer from the framework to the molecules and thereby significantly increasing electronic conductivity
Christina R. Deschene +7 more
wiley +2 more sources