Results 31 to 40 of about 1,659,955 (202)
Orientable Z_n-distance magic labeling of the Cartesian product of many cycles
Electronic Journal of Graph Theory and Applications, 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 ...
Bryan Freyberg, Melissa Keranen
doaj +1 more source
Public Key Cipher with Signature Based on Diffie-Hellman and the Magic Square Problem [PDF]
Engineering and Technology Journal, 2016 In the present paper, wedeveloped a new variant of asymmetric cipher (Public Key) algorithm based on the Discrete Logarithm Problem (DLP) uses Diffie-Hellman key exchange protocol and the mathematical features of magic square.
Abdul S.Rahma +2 more
doaj +1 more source
H-E-Super magic decomposition of graphs
Electronic Journal of Graph Theory and Applications, 2014 An H-magic labeling in an H-decomposable graph G is a bijection f:V(G) U E(G) --> {1,2, … ,p+q} such that for every copy H in the decomposition, $\sum\limits_{v\in V(H)} f(v)+\sum\limits_{e\in E(H)} f(e)$ is constant.
S.P. Subbiah, J. Pandimadevi
doaj +1 more source
On the super edge-magic deficiency of some graphs
Heliyon, 2020 A graph G is called super edge-magic if there exists a bijection f:V(G)∪E(G)⟶{1,2,⋯,|V(G)|+|E(G)|}, where f(V(G))={1,2,⋯,|V(G)|}, such that f(u)+f(uv)+f(v) is a constant for every edge uv∈E(G). Such a case, f is called a super edge magic labeling of G. A
Vira Hari Krisnawati +3 more
doaj +1 more source
Physical review letters, 2023 The excitation energy of the 1/2$^-$ isomer in $^{99}$In at ${N=50}$ is measured to be 671(37) keV and the mass uncertainty of the 9/2$^+$ ground state is significantly reduced using the ISOLTRAP mass spectrometer at ISOLDE/CERN. The measurements exploit a major improvement in the resolution of the multi-reflection time-of-flight mass spectrometer. The
Nies, L. +18 more
openaire +8 more sources
Union of Distance Magic Graphs
Discussiones Mathematicae Graph Theory, 2017 A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that the weight w(x) = ∑y∈NG(x) ℓ(y) of every vertex x ∈ V is equal to the same element μ, called the magic constant.
Cichacz Sylwia, Nikodem Mateusz
doaj +1 more source
Constant Sum Group Flows of Graphs
Mathematics, 2023 As an analogous concept of a nowhere-zero flow for directed graphs, zero-sum flows and constant-sum flows are defined and studied in the literature. For an undirected graph, a zero-sum flow (constant-sum flow resp.) is an assignment of nonzero integers ...
Tao-Ming Wang
doaj +1 more source
Zło magii w pastoralnych wskazaniach Ojców Kościoła
Vox Patrum, 2013 The article took up the problem of evil in magic in the teaching of the Church Fathers. The ancient priests were convinced that magic was the work of the devil himself.
Paweł Wygralak
doaj +1 more source
A Complete Characterization of Magic Constants Arising from Distance Magic Graphs
Journal of Combinatorial Mathematics and Combinatorial ComputingA positive integer \(k\) is called a magic constant if there is a graph \(G\) along with a bijective function \(f\) from \(V(G)\) to the first \(|V(G)|\) natural numbers such that the weight of the vertex \(w(v) = \sum_{uv \in E} f(u) = k\) for all \(v \in V\).
Pawar, Ravindra +3 more
openaire +3 more sources
, 2019 This work is dedicated to the search of dark matter in the Perseus Galaxy Cluster with MAGIC: Clusters of galaxies are the largest known gravitationally bound structures in the Universe, and most of their masses comes in the form of dark matter.
MAGIC Collaboration +1 more
core +1 more source