Results 11 to 20 of about 920 (119)
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
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
Regular graphs are antimagic [PDF]
The Electronic Journal of Combinatorics, 2015 An undirected simple graph G = (V,E) is called antimagic if there exists an injective function f: E → {1,…|E|} such that (formula presented) for any pair of different nodes u, v ∈ V.
Bernáth, Attila +2 more
core +5 more sources
Two constructions of -antimagic graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph. A graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . A graph admitting an -covering is called --antimagic if there is a bijection such that for each subgraph of isomorphic to , the sum of labels of all the
Andrea Semaničová-Feňovčíková +2 more
doaj +2 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
ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS [PDF]
Journal of Algebraic Systems, 2020 A {it local antimagic labeling} of a connected graph $G$ with at least three vertices, is a bijection $f:E(G) rightarrow {1,2,ldots , |E(G)|}$ such that for any two adjacent vertices $u$ and $v$ of $G$, the condition $omega _{f}(u) neq omega _{f}(v ...
S. Shaebani
doaj +3 more sources
Regular graphs of odd degree are antimagic [PDF]
Journal of Graph Theory, 2013 An antimagic labeling of a graph $G$ with $m$ edges is a bijection from $E(G)$ to $\{1,2,\ldots,m\}$ such that for all vertices $u$ and $v$, the sum of labels on edges incident to $u$ differs from that for edges incident to $v$.
Cranston, Daniel W.
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