45 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
Lattice Grids and Prisms are Antimagic
An \emph{antimagic labeling} of a finite undirected simple graph with
edges and vertices is a bijection from the set of edges to the integers
such that all 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 \emph{antimagic} if it has an antimagic labeling. In 1990, Hartsfield
and Ringel conjectured that every connected graph, but , is antimagic. In
2004, N. Alon et al showed that this conjecture is true for -vertex graphs
with minimum degree . They also proved that complete partite
graphs (other than ) and -vertex graphs with maximum degree at least
are antimagic. Recently, Wang showed that the toroidal grids (the
Cartesian products of two or more cycles) are antimagic. Two open problems left
in Wang's paper are about the antimagicness of lattice grid graphs and prism
graphs, which are the Cartesian products of two paths, and of a cycle and a
path, respectively. In this article, we prove that these two classes of graphs
are antimagic, by constructing such antimagic labelings.Comment: 10 pages, 6 figure
The Integer-antimagic Spectra of Graphs with a Chord
Let be a nontrival abelian group. A connected simple graph is -antimagic if there exists an edge labeling such that the induced vertex labeling , defined by , is injective. The integer-antimagic spectrum of a graph is the set IAM . In this paper, we determine the integer-antimagic spectra for cycles with a chord, paths with a chord, and wheels with a chord
Group-antimagic Labelings of Multi-cyclic Graphs
Let be a non-trivial abelian group. A connected simple graph is -\textbf{antimagic} if there exists an edge labeling such that the induced vertex labeling , defined by , is a one-to-one map. The \textit{integer-antimagic spectrum} of a graph is the set IAM. In this paper, we analyze the integer-antimagic spectra for various classes of multi-cyclic graphs
An Example Usage of Graph Theory in Other Scientific Fields: On Graph Labeling, Possibilities and Role of Mind/Consciousness
This paper provides insights into some aspects of the possibilities and role of mind, consciousness, and their relation to mathematical logic with the application of problem solving in the fields of psychology and graph theory. This work aims to dispel certain long-held notions of a severe psychological disorder and a well-known graph labeling conjecture. The applications of graph labelings of various types for various kinds of graphs are being discussed. Certain results in graph labelings using computer software are presented with a direction to discover more applications
Antimagic Labeling of Some Degree Splitting Graphs
A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. As Wang et al. [2012], proved that not all graphs are antimagic, it is interesting to investigate antimagic labeling of graph families. In this paper we discussed antimagic labeling of the larger graphs obtained using degree splitting operation on some known antimagic graphs. As discussed in Krishnaa [2016], antimagic labeling has many applications, our results will be used to expand the network on larger graphs