Results 1 to 10 of about 580,661 (153)
On Super Edge-Antimagicness of Subdivided Stars
Discussiones Mathematicae Graph Theory, 2015 Enomoto, Llado, Nakamigawa and Ringel (1998) defined the concept of a super (a, 0)-edge-antimagic total labeling and proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph.
Raheem A., Javaid M., Baig A.Q.
doaj +4 more sources
Two constructions of -antimagic graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph. A graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . A graph admitting an -covering is called --antimagic if there is a bijection such that for each subgraph of isomorphic to , the sum of labels of all the
Andrea Semaničová-Feňovčíková +2 more
doaj +4 more sources
Barekeng, 2023 Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah +4 more
doaj +2 more sources
On H-antimagic coverings for m-shadow and closed m-shadow of connected graphs. [PDF]
Heliyon, 2021 An (a,d)-H-antimagic total labeling of a simple graph G admitting an H-covering is a bijection φ:V(G)∪E(G)→{1,2,…,|V(G)|+|E(G)|} such that for all subgraphs H′ of G isomorphic to H, the set of H′-weights given by wtφ(H′)=∑v∈V(H′)φ(v)+∑e∈E(H′)φ(e) forms ...
Inayah N +2 more
europepmc +2 more sources
On Rainbow Antimagic Coloring of Joint Product of Graphs [PDF]
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +2 more sources
Dense graphs are antimagic [PDF]
Journal of Graph Theory, 2004 AbstractAn antimagic labeling of graph a with m edges and n vertices is a bijection from the set of edges to the integers 1,…,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is called antimagic if it has an antimagic labeling. A conjecture of Ringel (see 4)
Noga Alon +4 more
exaly +4 more sources
On local distance antimagic labeling of graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Let [Formula: see text] be a graph of order n and let [Formula: see text] be a bijection. For every vertex [Formula: see text], we define the weight of the vertex v as [Formula: see text] where N(v) is the open neighborhood of the vertex v. The bijection
Adarsh Kumar Handa +2 more
doaj +2 more sources
On the antimagicness of generalized edge corona graphs. [PDF]
HeliyonResumen Dado un gráfico G, una función de asignación de etiquetas distintas\{1,2,...,\|E\(G\)\|\} a E\(G\) tal que w\(a\)≠w\(b\), ∀ a,b∈V\(G\) es un etiquetado antimágico de G donde w\(a\) indica la suma de vértices obtenida al sumar todas las etiquetas asignadas a los bordes incidentes en el vértice a. Sean G, Hi, 1≤i≤m gráficos conectados tales que E\
D N, S DY.
europepmc +4 more sources
ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS [PDF]
Journal of Algebraic Systems, 2020 A {it local antimagic labeling} of a connected graph $G$ with at least three vertices, is a bijection $f:E(G) rightarrow {1,2,ldots , |E(G)|}$ such that for any two adjacent vertices $u$ and $v$ of $G$, the condition $omega _{f}(u) neq omega _{f}(v ...
S. Shaebani
doaj +3 more sources
Shifted-Antimagic Labelings for Graphs [PDF]
Graphs and Combinatorics, 2021 The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that every connected graph, except a single edge, is antimagic. Some graphs are known to be antimagic, but little has been known about sparse graphs, not even trees.
Fei-Huang Chang +3 more
openaire +3 more sources