Results 1 to 10 of about 935 (138)
Product Antimagic Labeling of Caterpillars [PDF]
Journal of Mathematics, 2021 Let G be a graph with m edges. A product antimagic labeling of G is a bijection from the edge set EG to the set 1,2,…,m such that the vertex-products are pairwise distinct, where the vertex-product of a vertex v is the product of labels on the incident ...
Shengze Wang, Yuping Gao
doaj +4 more sources
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 +3 more sources
Antimagic Labelings of Caterpillars [PDF]
Applied Mathematics and Computation, 2019 A $k$-antimagic labeling of a graph $G$ is an injection from $E(G)$ to $\{1,2,\dots,|E(G)|+k\}$ such that all vertex sums are pairwise distinct, where the vertex sum at vertex $u$ is the sum of the labels assigned to edges incident to $u$.
Lozano, Antoni +2 more
core +6 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
Caterpillars Have Antimagic Orientations [PDF]
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018 An antimagic labeling of a directed graph D with m arcs is a bijection from the set of arcs of D to {1, …, m} such that all oriented vertex sums of vertices in D are pairwise distinct, where the oriented vertex sum of a vertex u is the sum of labels of ...
Lozano Antoni
doaj +3 more sources
Antimagic Labeling of Some Biregular Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2022 An antimagic labeling of a graph G = (V, E) is a one-to-one mapping from E to {1, 2, . . ., |E|} such that distinct vertices receive different label sums from the edges incident to them. G is called antimagic if it admits an antimagic labeling.
Deng Kecai, Li Yunfei
doaj +2 more sources
On total labelings of graphs with prescribed weights
AKCE International Journal of Graphs and Combinatorics, 2016 Let G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic total labeling of G is a bijection f from V(G)∪E(G) onto the set of consecutive integers {1,2,…,|V(G)|+|E(G)|}, such that all the edge weights or vertex weights ...
Muhammad Irfan +1 more
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
On local antimagic total labeling of complete graphs amalgamation [PDF]
Opuscula Mathematica, 2023 Let \(G = (V,E)\) be a connected simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling.
Gee-Choon Lau, Wai Chee Shiu
doaj +1 more source
On Rainbow Antimagic Coloring of Joint Product of Graphs
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 +1 more source