Results 61 to 70 of about 201,420 (145)
Journal of MathematicsThe antimagic labeling of a graph is an important factor of graph theory, which implies the assignment of individual integer values to the graph’s vertices such that all the vertex sums remain unique. Due to the distinctive feature of antimagic labeling,
Poovarasi P, Kavitha K
doaj +1 more source
Local Antimagic Chromatic Number for Copies of Graphs
Mathematics, 2021 An edge labeling of a graph G=(V,E) using every label from the set {1,2,⋯,|E(G)|} exactly once is a local antimagic labeling if the vertex-weights are distinct for every pair of neighboring vertices, where a vertex-weight is the sum of labels of all ...
Martin Bača +2 more
doaj +1 more source
Weighted antimagic labeling: an algorithmic approach
Electronic Notes in Discrete Mathematics, 2015 Abstract A graph G = ( V , E ) is weighted-k-antimagic if for each w : V → R , there is an injective function f : E → { 1 , … , | E | + k } such that for each vertex u the following sums are all distinct: ∑ v : u v ∈ E f ( u v ) + w ( u ) .
Martín Matamala, José Zamora
openaire +2 more sources
Caterpillars Have Antimagic Orientations
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018 An antimagic labeling of a directed graph D with m arcs is a bijection from the set of arcs of D to {1, …, m} such that all oriented vertex sums of vertices in D are pairwise distinct, where the oriented vertex sum of a vertex u is the sum of labels of ...
Lozano Antoni
doaj +1 more source
On Antimagic Labeling of Lobsters [PDF]
, 2020 An antimagic labeling of a graph G with p edges is a function f: E(G) → {1,…,p} such that distinct edges receive distinct numbers and any two vertex sums are distinct, where a vertex sum is the sum of the labels of all edges incident to that vertex.
Klepitch, Brett +2 more
core +2 more sources
New Results of Face Labeling for Some Plane Graphs
IEEE Access, 2019 A labeling of a plane graph is called super d-antimagic if the vertices receive the smallest labels and the weight set of all faces in an arithematic progression with difference d, where weight of each face is the some of all labels correspond to that ...
Nabila Hameed +4 more
doaj +1 more source
On d-antimagic labelings of plane graphs
Electronic Journal of Graph Theory and Applications, 2013 The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called d-antimagic if for every positive integer s, the s-sided face weights form an arithmetic progression with a difference d.
Martin Baca +4 more
openaire +4 more sources
Lexicographic product graphs P m [ P n ] are antimagic
AKCE International Journal of Graphs and Combinatorics, 2018 A graph with q edges is called a n t i m a g i c if its edges can be labeled with 1, 2, …, q such that the sums of the labels on the edges incident to each vertex are distinct.
Wenhui Ma +3 more
doaj +2 more sources
List-antimagic labeling of vertex-weighted graphs [PDF]
, 2021 A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that $f(e)\in L(e)$ for ...
Danny Rorabaugh +9 more
core +1 more source
Group-antimagic Labelings of Multi-cyclic Graphs
Theory and Applications of Graphs, 2016 Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagic} if there exists an edge labeling $f: E(G) \to A \backslash \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \Sigma$
Dan Roberts, Richard Low
doaj +1 more source