Results 11 to 20 of about 956 (135)
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
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
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)
Alon, N. +4 more
openaire +5 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
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 +4 more sources
On (a,1)-Vertex-Antimagic Edge Labeling of Regular Graphs
Journal of Applied Mathematics, 2015 An (a,s)-vertex-antimagic edge labeling (or an (a,s)-VAE labeling, for short) of G is a bijective mapping from the edge set E(G) of a graph G to the set of integers 1,2,…,|E(G)| with the property that the vertex-weights form an arithmetic sequence ...
Martin Bača +3 more
doaj +2 more sources
On H-Supermagic Labelings of m-Shadow of Paths and Cycles
International Journal of Mathematics and Mathematical Sciences, 2019 A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgraph isomorphic to H. A bijection f:V∪E→{1,2,3,…,V+E} is an (a,d)-H-antimagic total labeling of G if, for all subgraphs H′ isomorphic to H, the sum of ...
Ika Hesti Agustin +5 more
doaj +2 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 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