Union of Distance Magic Graphs

Autor: Cichacz Sylwia, Nikodem Mateusz

Publikováno v: Discussiones Mathematicae Graph Theory, Vol 37, Iss 1, Pp 239-249 (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. In th

Externí odkaz: https://doaj.org/article/c80e75c823624df8b542177ca44ae501

Distance Magic Cartesian Products of Graphs

Autor: Cichacz Sylwia, Froncek Dalibor, Krop Elliot, Raridan Christopher

Publikováno v: Discussiones Mathematicae Graph Theory, Vol 36, Iss 2, Pp 299-308 (2016)

A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant.

Externí odkaz: https://doaj.org/article/e8799f7e78f045118123d0698de13311

On the uniqueness of d-vertex magic constant

Autor: Arumugam S., Kamatchi N., Vijayakumar G.R.

Publikováno v: Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 279-286 (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, . . . , n} such that for all v ∈ V,

Externí odkaz: https://doaj.org/article/27ccbba92939440091a6f52cce08c247

Improving the Accuracy of the Fast Inverse Square Root by Modifying Newton–Raphson Corrections

Autor: Leonid V. Moroz, Jan L. Cieśliński, Cezary J. Walczyk

Publikováno v: Entropy, Vol 23, Iss 86, p 86 (2021)
Entropy
Volume 23
Issue 1

Direct computation of functions using low-complexity algorithms can be applied both for hardware constraints and in systems where storage capacity is a challenge for processing a large volume of data. We present improved algorithms for fast calculati

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a49373b0fb23849630be844b227170f7
https://www.mdpi.com/1099-4300/23/1/86

A New Block Cipher Algorithm Using Magic Square of Order Five and Galois Field Arithmetic with Dynamic Size Block

Autor: Abdul Monem S. Rahma, Ibrahim Malik ALattar

Publikováno v: International Journal of Interactive Mobile Technologies (iJIM); Vol. 15 No. 16 (2021); pp. 63-78
International Journal of Interactive Mobile Technologies, Vol 15, Iss 16, Pp 63-78 (2021)

This paper describes the development of encryption algorithms using the magic square of order 5 and Multi-level keys with the addition of Matrix keys to increase implementation speed and complexity. This work relied mainly on the magic sum and some e

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac3f6da8ade148dad54c60df5b86f785
https://igi.indrastra.com/items/show/2076