Results 1 to 10 of about 201,420 (145)
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
Weighted antimagic labeling [PDF]
Discrete Applied Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Matamala, José Zamora
exaly +4 more sources
Antimagic Labeling of Some Biregular Bipartite Graphs [PDF]
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 +3 more sources
Antimagic Labeling for Product of Regular Graphs
Symmetry, 2022 An antimagic labeling of a graph G=(V,E) is a bijection from the set of edges of G to 1,2,⋯,E(G) and such that any two vertices of G have distinct vertex sums where the vertex sum of a vertex v in V(G) is nothing but the sum of all the incident edge labeling of G.
Vinothkumar Latchoumanane +1 more
exaly +3 more sources
Distance antimagic labeling of join and corona of two graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices .
Subramanian Arumugam, Aloysius Godinho
exaly +3 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
Antimagic labeling of new classes of trees [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 An antimagic labeling of a graph G with q edges is an injective mapping such that the induced vertex label for each vertex is different, where the induced vertex label of a vertex u is Here, E(u) is the set of edges incident to the vertex u. In 1990, Hartsfield and Ringel conjectured that all trees except K2 are antimagic. Still this conjecture is open.
G Sethuraman
exaly +3 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 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 +4 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