Related papers: Unity Product Graph of Some Commutative Rings
In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (Note that the…
Let $G$ be an undirected simple connected graph. We say a vertex $u$ is eccentric to a vertex $v$ in $G$ if $d(u,v)=\max\{d(v,w): w\in V(G)\}$. The eccentric graph, $E(G)$ of $G$ is a graph defined on the same vertex set as of $G$ and two…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover…
The zero-divisor graph $\Gamma(R)$ of an associative ring $R$ is the graph whose vertices are all nonzero zero-divisors (one-sided and two-sided) of $R$, and two distinct vertices $x$ and $y$ are joined by an edge iff either $xy=0$ or…
Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this paper, orthogonal…
In this article, we introduce balance equations over commutative rings $R$ and associate $R$-weighted graphs to them so that solving balance equations corresponds to a consistent labeling of vertices of the associated graph. Our primary…
Gcd-graphs represent an interesting and historically important class of integral graphs. Since the pioneering work of Klotz and Sander, numerous incarnations of these graphs have been explored in the literature. In this article, we define…
Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…
In this work, we study the $\delta$-chromatic number of a graph which is the chromatic number of the $\delta$-complement of a graph. We give a structure of the $\delta$-complements and sharp bounds on the $\delta$-chromatic numbers of the…
Given a finite group $G$, the invariably generating graph of $G$ is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of $G$, and two classes are adjacent if and only if they invariably generate $G$.…
The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing…
Graph products are characterized by the existence of non-trivial equivalence relations on the edge set of a graph that satisfy a so-called square property. We investigate here a generalization, termed RSP-relations. The class of graphs with…
A graph is well-covered if every maximal independent set has the same cardinality, namely the vertex independence number. We answer a question of Topp and Volkmann and prove that if the Cartesian product of two graphs is well-covered, then…
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
The annihilator graph $AG(R)$ of the commutative ring $R$ is an undirected graph with vertex set as the set of all non-zero zero divisors of $R$, and two distinct vertices $x$ and $y$ are adjacent if and only if $ann(xy) \neq ann(x) \cup…
A rectangular drawing of a planar graph $G$ is a planar drawing of $G$ in which vertices are mapped to grid points, edges are mapped to horizontal and vertical straight-line segments, and faces are drawn as rectangles. Sometimes this latter…
In recent work, we study certain Cayley graphs associated with a finite commutative ring and their multiplicative subgroups. Among various results that we prove, we provide the necessary and sufficient conditions for such a Cayley graph to…