63 research outputs found
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
New Results on Subtractive Magic Graphs
For any edge xy in a directed graph, the subtractive edge-weight is the sum of the label of xy and the label of y minus the label of x. Similarly, for any vertex z in a directed graph, the subtractive vertex-weight of z is the sum of the label of z and all edges directed into z and all the labels of edges that are directed away from z. A subtractive magic graph has every subtractive edge and vertex weight equal to some constant k. In this paper, we will discuss variations of subtractive magic labelings on directed graphs
The integer-antimagic spectra of a disjoint union of Hamiltonian graphs
Let A be a nontrivial abelian group. A simple graph G = (V,E) is A-antimagic, if there exists an edge labeling f: E(G) → A\{0} such that the induced vertex labeling (Formula Presented) is a one-to-one map. The integer-antimagic spectrum of a graph G is the set IAM(G) = {k: G is Zk-antimagic and k ≥ 2}. In this paper, we determine the integer-antimagic spectra for a disjoint union of Hamiltonian graphs
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
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
(Di)graph products, labelings and related results
Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can also obtain enumerative results that provide lower bounds on the number of nonisomorphic labelings of a particular type. In this paper, we will focus in three of the (di)graphs products that have been used in these duties: the ⊗h-product of digraphs, the weak tensor product of graphs and the weak ⊗h-product of graphs.Reseach supported by the Spanish Government under project MTM2014-60127-P and symbolically by the Catalan Research Council under grant 2014SGR1147
Antimagic labeling of the union of subdivided stars
Enomoto et al. (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 labeling. In support of this conjecture, the present paper deals with different results on antimagicness of subdivided stars and their unions.Publisher's Versio
On the Integer-antimagic Spectra of Non-Hamiltonian Graphs
Let be a nontrivial 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. In this paper, we analyze the group-antimagic property for Cartesian products, hexagonal nets and theta graphs
- …