Results 1 to 10 of about 1,609,249 (128)
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
The PUMP Journal of Undergraduate Research, 2023 An antimagic labeling of a graph G(V,E) is a bijection f mapping from E to the set {1,2,…, |E|}, so that for any two different vertices u and v, the sum of f(e) over all edges e incident to u, and the sum of f(e) over all edges e incident to v, are ...
Johnny Sierra +2 more
semanticscholar +4 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 Antimagic Labeling for Some Families of Graphs
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2023 Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct.
Noor K. Shawkat, Mohammed A. Ahmed
doaj +2 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
Antimagic Labeling for Some Snake Graphs
Proyecciones (Antofagasta)A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct.
C. Barasara, P. Prajapati
semanticscholar +2 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
Super (a,d)-P_2⨀P_m-Antimagic Total Labeling of Corona Product of Two Paths
JTAM (Jurnal Teori dan Aplikasi Matematika)Graph labeling involves mapping the elements of a graph (edges and vertices) to a set of positive integers. The concept of an anti-magic super outer labeling (a,d)-H pertains to assigning labels to the vertices and edges of a graph using natural numbers {
Bela Zainun Yatin +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 +3 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 +2 more sources