Results 21 to 30 of about 1,609,249 (128)
Antimagic labelings of caterpillars [PDF]
13 pages, 4 ...
Lozano Boixadors, Antoni +2 more
openaire +5 more sources
Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah +4 more
doaj +1 more source
Antimagic Labeling of Generalized Edge Corona Graphs (preprint) [PDF]
An antimagic labeling of a graph $G$ is a one-to-one correspondence between the edge set $E(G)$ and $\lbrace 1,2,...,|E(G)|\rbrace$ in which the sum of the edge labels incident on the distinct vertices are distinct. Let $G$,$H_1$,$H_2$,...,$H_{m-1}$, and
D. Nivedha, S. DeviYamini
semanticscholar +1 more source
Antimagic labeling for unions of graphs with many three-paths [PDF]
Let $G$ be a graph with $m$ edges and let $f$ be a bijection from $E(G)$ to $\{1,2, \dots, m\}$. For any vertex $v$, denote by $\phi_f(v)$ the sum of $f(e)$ over all edges $e$ incident to $v$.
Angel Chavez +4 more
semanticscholar +1 more source
Trees Whose Even-Degree Vertices Induce a Path are Antimagic
An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . ., |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels assigned to edges incident to v.
Lozano Antoni +3 more
doaj +1 more source
Antimagic Labeling of Extension of Double Star [PDF]
An antimagic labeling of a simple, finite connected graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, …, q} such that the vertex sums are pairwise distinct where the vertex sum at one vertex is the sum ...
Dr C. Meenakshi
doaj
ANTIMAGIC LABELING OF DIGRAPHS [PDF]
AbstractAn antimagic labeling of a digraph D with p vertices and q arcs is a bin f from the set of all arcs to the set of positive integers such that all the p oriented vertex weights are distinct, where an oriented vertex weight is the sum of the labels of all arcs entering that vertex minus the sum of the labels of all arcs leaving it. A digraph
openaire +2 more sources
Super H-Antimagic Total Covering for Generalized Antiprism and Toroidal Octagonal Map
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 +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matamala, Martín, Zamora, José
openaire +2 more sources
The Integer-antimagic Spectra of Graphs with a Chord
Let $A$ be a nontrival abelian group. A connected simple graph $G = (V, E)$ is $A$-antimagic if there exists an edge labeling $f: E(G) \to A \setminus \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \sum_{uv\in E(G)}f(
Richard Low, Dan Roberts, Jinze Zheng
doaj +1 more source

