Results 71 to 80 of about 412,708 (144)

Antimagic Labeling for Unions of Graphs with Many Three-Paths [PDF]

, 2022
Let $G$ be a graph with $m$ edges and let $f$ be a bijection from $E(G)$ to $\{1,2, \dots, m\}$. For any vertex $v$, denote by $\phi_f(v)$ the sum of $f(e)$ over all edges $e$ incident to $v$.
Chavez, Angel, Shurman, Mason, Liu, Daphne Der-Fen, Lin, Derek, Le, Parker   +4 more
core   +1 more source

Construction for antimagic generalized web graphs

, 2011
An antimagic labeling of a graph with q edges is a bijection from the set of edges to the set of integers {1, 2, ..., q} such that all vertex weights are pairwise distinct, where the vertex weight is the sum of labels of all edges incident with the ...
Miller, Mirka, Rylands, Leanne J. (R8511), Phanalasy, Oudone, Ryan, Joe   +3 more
core  

Strongly Antimagic Graphs

, 2022
A graph is a set of {\it{vertices}}, and {\it{edges}} which connect vertices. Given any graph $G$ with $m$ edges, we assign integers from $1$ to $m$ to the edges of $G$ and consider vertex sums, the sums of the edge labels incident at each vertex.
LE, PARKER
core  

Local inclusive distance antimagic coloring of graphs

Indonesian Journal of Combinatorics
For a simple graph G, a bijection f : V(G) → [1,|V (G)|] is called as a local inclusive distance antimagic (LIDA) labeling of G if w(u) ≠ w(v) for every two adjacent vertices u,v ∈ V(G) with w(u) = ∑x∈N [u] f(x).
Fawwaz Fakhrurrozi Hadiputra, Mohammad Farhan, Mukayis Mukayis, Suhadi Wido Saputro, Tita Khalis Maryati   +4 more
doaj   +1 more source

Local edge antimagic coloring for chain of path and cycle

Indonesian Journal of Combinatorics
Let G=(V,E) be a simple connected graph with vertex set V and edge set E. A local edge antimagic labeling of G is a bijection f:V (G)→{1, 2, 3, ... , |V(G)|} where the weights of any two adjacent edges of G are distinct.
Yosua Walfried, Ivana Joice Chandra, Denny Riama Silaban   +2 more
doaj   +1 more source

The analysis of the implementation of RBL-STEM learning materials in improving student's meta-literacy ability to solve wallpaper decoration problems using local antimagic graph coloring techniques. [PDF]

Heliyon, 2023
Dafik, Kadir, Maryati TK, Sufirman, Ridlo ZR.   +4 more
europepmc   +1 more source

COMPLEMENTARY TOTALLY ANTIMAGIC TOTAL GRAPHS

, 2017
<p>For a graph G, with the vertex set V(G) and the edge set E(G), a total labeling is a bijection f from V (G) U E(G) to the set of integers {1, 2, …, |V (G) |+| E(G) |}.
Mallikarjun Ghaleppa*, Danappa G Akka
core   +1 more source

On H-antimagic coverings for m-shadow and closed m-shadow of connected graphs. [PDF]

Heliyon, 2021
Inayah N, Susanto F, Semaničová-Feňovčíková A.   +2 more
europepmc   +1 more source

On $H$-antimagicness of Cartesian product of graphs

TURKISH JOURNAL OF MATHEMATICS, 2018
Summary: A graph \(G=(V(G),E(G))\) admits an \(H\)-covering if every edge in \(E\) belongs to a subgraph of \(G\) isomorphic to \(H\). A graph \(G\) admitting an \(H\)-covering is called \((a,d)\)-\(H\)-antimagic if there is a bijection \(f:V(G)\cup E(G) \to \{1,2,\dots, |V(G)|+|E(G)| \}\) such that, for all subgraphs \(H^\prime\) of \(G\) isomorphic ...
Bača, Martin, Semaničová-Feňovčíková, Andrea, Umar, Muhammad Awais, Welyyanti, Des   +3 more
openaire   +2 more sources

On regular handicap graphs of order $n \equiv 0$ mod 8

Electronic Journal of Graph Theory and Applications, 2018
A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f̂ : V → {1, 2, …, n} with the property that f̂(xi) = i, the weight w(xi) is the sum of labels of all neighbors of xi, and the sequence of the weights w(x1), w(x2)
Dalibor Froncek, Aaron Shepanik
doaj   +1 more source