Results 111 to 120 of about 1,609,249 (128)

Antimagic labeling of generalized pyramid graphs

Acta Mathematica Sinica, English Series, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arumugam, Subramanian, Miller, Mirka, Phanalasy, Oudone, Ryan, Joe   +3 more
openaire   +2 more sources

Development of RBL-STEM Learning to Improve Students' Conjecturing Thinking Skills in Asymmetric Cryptography Problems in Blockchain Technology Using Super (a,d)-Hyperedge Antimagic Total Labeling of Hypergraphs

World Journal of Advanced Research and Reviews
The rapid evolution of blockchain technology underscores the need to enhance students' conjecturing thinking skills. Research-Based Learning (RBL), combined with Science, Technology, Engineering, and Mathematics (STEM) approaches, offers an effective ...
I. I. Makhfudloh, Alvian Bagus, A. Kristiana   +2 more
semanticscholar   +1 more source

Super d-antimagic labelings of disconnected plane graphs

Acta Mathematica Sinica, English Series, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bača, Martin, Miller, Mirka, Phanalasy, Oudone, Semaničová-Feñovčíková, Andrea   +3 more
openaire   +1 more source

On \(d\)-antimagic labelings of prisms.

2004
Let \(G\) be a plane graph with \(v\) vertices, \(e\) edges, and \(f\) faces. We label each vertex, each edge, and each face with exactly one number from the set \(\{1, 2, \ldots , v+e+f\}\). The weight of a face is the sum of labels of the face itself together with labels of vertices and edges surrounding that face.
Lin, Y., Slamin, Baca, M., Miller, M.
openaire   +1 more source

Some Results on Inclusive Distance Antimagic Labeling of Graphs

Journal of the Indonesian Mathematical Society
Let $G=(V,E)$ be a graph of order $n$. A bijection $f:V(G)\rightarrow \{1,2,\cdots,n\}$ is called inclusive distance antimagic labeling if $w(u)\ne w(v)$ for any two distinct vertices $u,v\in V(G)$, where $w(v) = \displaystyle \sum_{x\in N[v]} f(x)$.
Christyan Tamaro Nadeak
semanticscholar   +1 more source

Distance Antimagic Labeling of Special Classes of Graphs

international journal of engineering trends and technology
Labeled graphs serve as a versatile mathematical model with diverse applications in engineering fields. A bijective function 𝜗:𝑉(𝐺) → {1,2,…,𝑛} is a distance antimagic labeling of a graph G with n vertices such that the vertex weights determined by 𝜔(𝑎) =
A. Yadav, M. S.
semanticscholar   +1 more source

Inclusive Distance Antimagic Labeling of Shadow Graph of Complete and Circulant Graph

Jurnal Matematika UNAND
Consider a graph $G = (V, E)$ with order $n$. Suppose that we have a bijection $f: V(G) \to \{1, 2, ..., n\}$. A graph $G$ is said to admit an inclusive distance antimagic labeling if every pair of distinct vertices has different weights, with a vertex ...
Siti Hafshah Nurul Arafah, K. A. Sugeng, D. O. Haryeni   +2 more
semanticscholar   +1 more source

Total balanced antimagic labeling

Journal of Combinatorial Mathematics and Combinatorial Computing
Let \(G\) be a graph. We introduce the balanced antimagic labeling as an analogue to the antimagic labeling. A \(k\)-total balanced antimagic labelling is a map \(c\colon V (G)\cup E(G) \to \{1,2,\ldots,k\}\) such that: the label classes differ in size ...
S. Cichacz, Rita Zuazua
semanticscholar   +1 more source

Antimagic Labeling of Bi-Star Graphs for Secure and Efficient Cryptographic Data Transformation

International Journal for Global Academic & Scientific Research
Graph labeling is a fundamental concept in graph theory with applications in networks, cryptography, and data security. Graph-based cryptographic models and ECC-based methods provide partial solutions but individually face limitations in randomness ...
B. Roopa, J. Saral, R. Senthamizh Selvi, R. Binthiya   +3 more
semanticscholar   +1 more source

Correction: Latchoumanane, V.; Varadhan, M. Antimagic Labeling for Product of Regular Graphs. Symmetry 2022, 14, 1235

Symmetry
In Abstract and Keywords, Text correction: [...]
Vinothkumar Latchoumanane, Murugan Varadhan   +1 more
semanticscholar   +1 more source