Results 81 to 90 of about 580,661 (153)
JTAM (Jurnal Teori dan Aplikasi Matematika)Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik +5 more
doaj +1 more source
Super Total Labeling (a,d)- edge Antimagic on the Firecracker Graph
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2020 An (a, d)-edge-antimagic total labeling on (p, q)-graph G is a one-to-one map f from V (G) ∪ E(G) onto the integers 1, 2, . . . , p + q with the property that the edge-weights, w(uv) = f (u)+ f (v) + f (uv) where uv ∈ E(G),form an arithmetic ...
Juhari Juhari
doaj +1 more source
SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF PENTAGONAL CHAIN GRAPH [PDF]
, 2015 . A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a bijection f: V(G)E(G) {1,2,…,p+q} such that the edge-weights, w(uv)=f(u)+f(v)+f(uv), uv E(G), form an arithmetic sequence with first term a and common ...
Slamin, S +2 more
core +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 +4 more
europepmc +1 more source
lnteger-antimagic Labeling of Graphs
, 2022 Let A be a non-trivial abelian group. A connected simple graph G = (V, E) is A-antimagic, ifthere exists an edge labeling : () → \{0} such that the induced vertex labeling +() =Σ{,}∈ () ({, }) is a one-to-one map.
Odabaşı, Uğur
core
Antimagic Total labeling of Disjoint Union of Disconnected Graph
, 2013 YEAR/VOLUME/NUMBER/PAGE:2013/April/Ed IIIA network topology (either communication network in general or a network in a computer) can be modeled as a graph or a directed graph (digraph, for short), where each processing element is represented by a ...
Dafik
core
On local edge antimagic chromatic number of graphs
, 2022 Let G=(V,E) be a graph of order p and size q having no isolated vertices. A bijection f from V to {1,2,3,...,p} is called a local edge antimagic labeling if for any two adjacent edges e=uv and e'=vw of G, we have w(e) is not equal to w (e'), where the ...
Nalliah, M., Rajkumar, S., M, Nalliah
core +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 +3 more
openaire +2 more sources
Totally antimagic total graphs.
Australas. J Comb., 2015 For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, ., |V(G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge.
Bača, Martin +5 more
openaire +2 more sources
, 2011 We call a graph antimagic if we can distribute the numbers 1,2, ...,n among its n Pearls in graph theory, Nora Hartsfield and Gerhard Ringel conjectured that every graph except for K2 has an antimagic edge labeling. Let's call a graph weakly antimagic if
Micheal Jackanich
core