62 research outputs found
Antimagic Labelings of Weighted and Oriented Graphs
A graph is - if for any vertex weighting
and any list assignment with there exists an edge labeling
such that for all , labels of edges are pairwise
distinct, and the sum of the labels on edges incident to a vertex plus the
weight of that vertex is distinct from the sum at every other vertex. In this
paper we prove that every graph on vertices having no or
component is -weighted-list-antimagic.
An oriented graph is - if there exists an
injective edge labeling from into such that the
sum of the labels on edges incident to and oriented toward a vertex minus the
sum of the labels on edges incident to and oriented away from that vertex is
distinct from the difference of sums at every other vertex. We prove that every
graph on vertices with no component admits an orientation that is
-oriented-antimagic.Comment: 10 pages, 1 figur
Regular graphs of odd degree are antimagic
An antimagic labeling of a graph with edges is a bijection from
to such that for all vertices and , the sum of
labels on edges incident to differs from that for edges incident to .
Hartsfield and Ringel conjectured that every connected graph other than the
single edge has an antimagic labeling. We prove this conjecture for
regular graphs of odd degree.Comment: 5 page
Antimagic Labelings of Caterpillars
A -antimagic labeling of a graph is an injection from to
such that all vertex sums are pairwise distinct, where
the vertex sum at vertex is the sum of the labels assigned to edges
incident to . We call a graph -antimagic when it has a -antimagic
labeling, and antimagic when it is 0-antimagic. Hartsfield and Ringel
conjectured that every simple connected graph other than is antimagic,
but the conjecture is still open even for trees. Here we study -antimagic
labelings of caterpillars, which are defined as trees the removal of whose
leaves produces a path, called its spine. As a general result, we use
constructive techniques to prove that any caterpillar of order is -antimagic. Furthermore, if is a caterpillar with a
spine of order , we prove that when has at least leaves or consecutive vertices of degree at
most 2 at one end of a longest path, then is antimagic. As a consequence of
a result by Wong and Zhu, we also prove that if is a prime number, any
caterpillar with a spine of order , or is -antimagic.Comment: 13 pages, 4 figure
On Distance Magic Harary Graphs
This paper establishes two techniques to construct larger distance magic and
(a, d)-distance antimagic graphs using Harary graphs and provides a solution to
the existence of distance magicness of legicographic product and direct product
of G with C4, for every non-regular distance magic graph G with maximum degree
|V(G)|-1.Comment: 12 pages, 1 figur
Antimagic Labeling for Unions of Graphs with Many Three-Paths
Let be a graph with edges and let be a bijection from to
. For any vertex , denote by the sum of
over all edges incident to . If holds
for any two distinct vertices and , then is called an {\it antimagic
labeling} of . We call {\it antimagic} if such a labeling exists.
Hartsfield and Ringel in 1991 conjectured that all connected graphs except
are antimagic. Denote the disjoint union of graphs and by , and the disjoint union of copies of by . For an antimagic graph
(connected or disconnected), we define the parameter to be the
maximum integer such that is antimagic for all .
Chang, Chen, Li, and Pan showed that for all antimagic graphs , is
finite [Graphs and Combinatorics 37 (2021), 1065--1182]. Further, Shang, Lin,
Liaw [Util. Math. 97 (2015), 373--385] and Li [Master Thesis, National Chung
Hsing University, Taiwan, 2019] found the exact value of for special
families of graphs: star forests and balanced double stars respectively. They
did this by finding explicit antimagic labelings of and proving a
tight upper bound on for these special families. In the present
paper, we generalize their results by proving an upper bound on for
all graphs. For star forests and balanced double stars, this general bound is
equivalent to the bounds given in \cite{star forest} and \cite{double star} and
tight. In addition, we prove that the general bound is also tight for every
other graph we have studied, including an infinite family of jellyfish graphs,
cycles where , and the double triangle
- …