Results 1 to 10 of about 18,500 (156)
On constant sum partitions and applications to distance magic-type graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Let be an additive abelian group of order and let be a partition of where A constant sum partition (or -sum partition) of is a pairwise disjoint union of subsets such that and for some fixed and every In 2009, Kaplan, Lev, and Roditty proved that a 0-sum
Bryan Freyberg
doaj +3 more sources
On the uniqueness of d-vertex magic constant
Discussiones Mathematicae Graph Theory, 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, . . .
Arumugam S. +2 more
doaj +4 more sources
Construction of a repetitive magic square with Ramanujan's number as its product
Heliyon, 2023 In this article, we build a repetitive magic square by multiplying four elements. This square is a matrix with its corresponding elements. The elements of this matrix that take different values allow us to obtain Ramanujan's number 1729 as its ...
Prasantha Bharathi Dhandapani +2 more
doaj +3 more sources
Fast calculation of inverse square root with the use of magic constant – analytical approach [PDF]
Applied Mathematics and Computation, 2018 17 pages, 8 ...
Jan L Cieslinski, Cezary Walczyk
exaly +6 more sources
Improving the Magic constant – data-based calibration of phased array radars [PDF]
Geoscientific Instrumentation, Methods and Data SystemsWe present a method for improved calibration of multi-point electron density measurements from incoherent scatter radars (ISR). It is based on the well-established Flatfield correction method used in imaging and photography, where we exploit the ...
T. Rexer +9 more
doaj +4 more sources
Application of the Combinatorial Nullstellensatz to Integer-magic Graph Labelings
Theory and Applications of Graphs, 2022 Let $A$ be a nontrivial abelian group and $A^* = A \setminus \{0\}$. A graph is $A$-magic if there exists an edge labeling $f$ using elements of $A^*$ which induces a constant vertex labeling of the graph.
Richard Low, Dan Roberts
doaj +1 more source
Improving the Accuracy of the Fast Inverse Square Root by Modifying Newton–Raphson Corrections
Entropy, 2021 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.
Cezary J. Walczyk +2 more
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2018 A graph , where and is said to be a distance magic graph if there exists a bijection from the vertex set to the set such that, , for all , which is a constant and independent of , where is the open neighborhood of the vertex .
Aloysius Godinho, T. Singh
doaj +2 more sources
A C3 Magic Decomposition on Friendship Graph with Odd Order
Jurnal Ilmu Dasar, 2022 Let G = (V,E) is graph with a non-empty set V containing vertices and a set of edges E. Also note that if H = {H_i⊆G_i = 1,2,3,...,n} is a collection of subgraphs from G with H_i≅Hj,i ≠ j.
Indah Chairun Nisa +2 more
doaj +1 more source
(s, d) Magic Labeling of some ladder graphs [PDF]
E3S Web of Conferences, 2023 Let G(p, q) be a connected, undirected, simple and non-trivial graph with q nodes and q lines. Let f be an injective function f: V(G) →{ s, s + d, s + 2d,.....s + (q +1)d } and g be an injective function g: E(G) → {d,2d,3d,… 2(q-1)d}.Then the graph G is ...
Sumathi P., Mala P.
doaj +1 more source