Results 81 to 90 of about 201,420 (145)
, 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
Edge Antimagic Total Labeling of Graphs
, 2015 The definition of (a, d)-edge-antimagic total labeling was introduced by Simanjuntak, Bertault and Miller as a natural extension of edge-magic labeling defined by Kotzig and ...
A.Raheem
core +1 more source
SUPER (a,d)-EDGE-ANTIMAGIC TOTAL LABELING OF SILKWORM GRAPH [PDF]
, 2015 . An  (a, d)-edge-antimagic  total  labeling  of G  is a  one-to-one  mapping taking the vertices and edges onto {1, 2, 3, . . . , p + q} Such that the edge-weights w(uv)  = (u)+(v)+(uv), uv ∈ E(G)  form an arithmetic sequence {a, a+d, a ...
Slamin, S, Hadi, Dian Anita, Dafik, D
core +1 more source
Antimagic Labeling of Graphs Using Prime Numbers [PDF]
Graph labeling is a technique that assigns unique labels or weights to the vertices or edges of a graph, often used to analyze and solve various graph-related problems. There are few methods with certain limitations conducted by researchers previously on
Habib, Md. Imtiaz, Islam, Arafat
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
New Construction on Edge-Antimagic Labeling
, 2012 An edge magic total labeling of a graph with p vertices and q edges is a bijection from the set of vertices and edges to 1, 2, . . . , p + q such that for every edge the sums of the label of the edge and the label of its two end vertices are constant ...
S Babitha, J Baskar Babujee, D Prathap
core
Super (a,d)-EAT labeling of subdivided stars
AKCE International Journal of Graphs and Combinatorics, 2015 Kotzig and Rosa conjectured that every tree admits an edge-magic total labeling. Enomoto et al. proposed the conjecture that every tree is a super (a,0)-edge-antimagic total graph.
M. Javaid
doaj +1 more source
On Super Edge Local Antimagic Total Labeling by Using an Edge Antimagic Vertex Labeling Technique
, 2019 INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 07, JULY 2019In this paper, we consider that all graphs are finite, simple and connected. Let G(V,E) be a graph of vertex set V and edge set E.
Alfarisi, Ridho +4 more
core
Magic and antimagic labeling of graphs [PDF]
, 2005 "A bijection mapping that assigns natural numbers to vertices and/or edges of a graph is called a labeling. In this thesis, we consider graph labelings that have weights associated with each edge and/or vertex.
Sugeng, Kiki Ariyanti
core
Cauchy: Jurnal Matematika Murni dan AplikasiThis article discusses a local antimagic coloring which is a combination between antimagic labeling and coloring. It is a new notion. We define a vertex weight of as where is the set of edges incident to .
R. Sunder +5 more
doaj +1 more source