Results 11 to 20 of about 580,661 (153)
Every graph is local antimagic total and its applications [PDF]
Opuscula Mathematica, 2023 Let \(G = (V,E)\) be a simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling. A bijection \(g : E \to \{1,2,\ldots,q\}\) is called a local antimagic labeling of \(G\)
Gee-Choon Lau +2 more
doaj +3 more sources
Product Antimagic Labeling of Caterpillars
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 +2 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 +2 more sources
PELABELAN SELIMUT TOTAL SUPER (a,d)-H ANTIMAGIC PADA GRAPH LOBSTER BERATURAN L_n (q,r) [PDF]
E-Jurnal Matematika, 2017 Graph labelling is a function that maps graph elements to positive integers. A covering of graph is family subgraph from , for with integer k. Graph admits covering if for every subgraph is isomorphic to a graph .
TIRA CATUR ROSALIA +2 more
doaj +3 more sources
Tree-Antimagicness of Disconnected Graphs [PDF]
Mathematical Problems in Engineering, 2015 A simple graphGadmits anH-covering if every edge inE(G)belongs to a subgraph ofGisomorphic toH. The graphGis said to be (a,d)-H-antimagic if there exists a bijection from the vertex setV(G)and the edge setE(G)onto the set of integers1, 2, …,VG+E(G)such that, for all subgraphsH′ofGisomorphic toH, the sum of labels of all vertices and edges belonging toH′
Bača, Martin +3 more
openaire +3 more sources
Super H-Antimagic Total Covering for Generalized Antiprism and Toroidal Octagonal Map
Journal of Mathematics, 2021 Let G be a graph and H⊆G be subgraph of G. The graph G is said to be a,d-H antimagic total graph if there exists a bijective function f:VH∪EH⟶1,2,3,…,VH+EH such that, for all subgraphs isomorphic to H, the total H weights WH=WH=∑x∈VHfx+∑y∈EHfy forms an ...
Amir Taimur +4 more
doaj +2 more sources
Graphs of Large Linear Size Are Antimagic [PDF]
Journal of Graph Theory, 2015 AbstractGiven a graph and a colouring , the induced colour of a vertex v is the sum of the colours at the edges incident with v. If all the induced colours of vertices of G are distinct, the colouring is called antimagic. If G has a bijective antimagic colouring , the graph G is called antimagic.
Feihuang Chang; Yu-Chang Liang; Zhishi Pan; Xuding Zhu
openaire +3 more sources
Journal of Mathematics, 2021 An edge labeling of graph G with labels in A is an injection from EG to A, where EG is the edge set of G, and A is a subset of ℝ. A graph G is called ℝ-antimagic if for each subset A of ℝ with A=EG, there is an edge labeling with labels in A such that ...
Yi-Wu Chang, Shan-Pang Liu
doaj +2 more sources
Proof of a local antimagic conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 An antimagic labelling of a graph $G$ is a bijection $f:E(G)\to\{1,\ldots,E(G)\}$ such that the sums $S_v=\sum_{e\ni v}f(e)$ distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1994) is that every connected graph other than $K_2 ...
John Haslegrave
doaj +3 more sources
Antimagic and Product Antimagic Graphs with Pendant Edges
Mediterranean Journal of MathematicsAbstract Let $$G=(V,E)$$ G = ( V ,
Mora Giné, Mercè +1 more
openaire +4 more sources