Sharif Digital Repository

In this paper we introduce a chromatic parameter, called the fixing chromatic number, which is related to unique colourability of graphs, in the sense that it measures how one can embed the given graph G in G∪Kt by adding edges between G and Kt to make the whole graph uniquely t-colourable. We study some basic properties of this parameter as well as its relationships to some other well-known chromatic numbers as the acyclic chromatic number. We compute the fixing chromatic number of some graph products by applying a modified version of the exponential graph construction  

Let G be a graph. It is well-known that G contains a proper vertex-coloring with χ(G) colors with the property that at least one color class of the coloring is a dominating set in G. Among all such proper vertex-coloring of the vertices of G, a coloring with the maximum number of color classes that are dominating sets in G is called a dominating-χ-coloring of G. The number of color classes that are dominating sets in a dominating-χ-coloring of G is defined to be the dominating-χ-color number of G and is denoted by dχ(G). In this paper, we prove that if G is a claw-free graph with minimum degree at least two, then dχ(G)≥2  

Let R be a ring and Z(R) be the set of all zero-divisors of R. The total graph of R, denoted by T(Γ(R)) is a graph with all elements of R as vertices, and two distinct vertices x, y∈R are adjacent if and only if x+y∈Z(R). Let the regular graph of R, Reg(Γ(R)), be the induced subgraph of T(Γ(R)) on the regular elements of R. In 2008, Anderson and Badawi proved that the girth of total graph and regular graph of a commutative ring are contained in the set {3, 4, ∞}. In this paper, we extend this result to an arbitrary ring (not necessarily commutative). Also, we prove that if R is a reduced left Noetherian ring and 2∈Z(R), then the chromatic number and the clique number of Reg(Γ(R)) are the... 

Let R be a ring and Z(R) be the set of all zero-divisors of R. The total graph of R, denoted by (TΓ (R)) is a graph with all elements of R as vertices, and two distinct vertices x, y in R are adjacent if and only if x + y Z(R). Let the regular graph of R, Reg (Γ(R)), be the induced subgraph of T(Γ (R)) on the regular elements of R. In 2008, Anderson and Badawi proved that the girth of the total graph and the regular graph of a commutative ring are contained in the set { 3, 4,} . In this paper, we extend this result to an arbitrary ring (not necessarily commutative). We also prove that if R is a reduced left Noetherian ring and 2 Z(R), then the chromatic number and the clique number of Reg... 

Let R be a commutative ring with unity and R+, U(R), and Z*(R) be the additive group, the set of unit elements, and the set of all nonzero zero-divisors of R, respectively. We denote by ℂAY(R) and GR, the Cayley graph Cay(R+, Z*(R)) and the unitary Cayley graph Cay(R+, U(R)), respectively. For an Artinian ring R, Akhtar et al. (2009) studied GR. In this article, we study ℂAY(R) and determine the clique number, chromatic number, edge chromatic number, domination number, and the girth of ℂAY(R). We also characterize all rings R whose ℂAY(R) is planar. Moreover, we determine all finite rings R whose ℂAY(R) is strongly regular. We prove that ℂAY(R) is strongly regular if and only if it is edge... 

Let R be a ring and X R be a non-empty set. The regular graph of X, Γ(X), is defined to be the graph with regular elements of X (non-zero divisors of X) as the set of vertices and two vertices are adjacent if their sum is a zero divisor. There is an interesting question posed in BCC22. For a field F, is the chromatic number of Γ( GLn(F)) finite? In this paper, we show that if G is a soluble subgroup of GLn(F), then χ(Γ(G))<∞. Also, we show that for every field F, χ(Γ( Mn(F)))=χ(Γ( Mn(F(x)))), where x is an indeterminate. Finally, for every algebraically closed field F, we determine the maximum value of the clique number of Γ(), where denotes the subgroup generated by A∈ GLn(F)  

Let R be a ring with identity and M be a unitary left R-module. The intersection graph of an R-module M, denoted by G(M), is defined to be the undirected simple graph whose vertices are in one to one correspondence with all non-trivial submodules of M and two distinct vertices are adjacent if and only if the corresponding submodules of M have nonzero intersection. We investigate the interplay between the module-theoretic properties of M and the graph-theoretic properties of G(M). We characterize all modules for which the intersection graph of submodules is connected. Also the diameter and the girth of G(M) are determined. We study the clique number and the chromatic number of G(M). Among... 

In this paper, we discuss some recent results on graphs attached to rings. In particular, we deal with comaximal graphs, unit graphs, and total graphs. We then define the notion of cototal graph and, using this graph, we characterize the rings which are additively generated by their zero divisors. Finally, we glance at graphs attached to other algebraic structures  

A graph is called weakly perfect if its chromatic number equals its clique number. In this note a new class of weakly perfect graphs is presented and an explicit formula for the chromatic number of such graphs is given  

Let R be a commutative ring with unity and R+ and Z*(R) be the additive group and the set of all nonzero zero-divisors of R, respectively. We denote by ℂ𝔸𝕐(R) the Cayley graph Cay(R+, Z*(R)). In this article, we study ℂ𝔸𝕐(R). Among other results, it is shown that for every zero-dimensional nonlocal ring R, ℂ𝔸𝕐(R) is a connected graph of diameter 2. Moreover, for a finite ring R, we obtain the vertex connectivity and the edge connectivity of ℂ𝔸𝕐(R). As a result, ℂ𝔸𝕐(R) gives an algebraic construction for vertex transitive graphs of maximum connectivity. In addition, we characterize all zero-dimensional semilocal... 

Let G be a group. The power graph of G is a graph with the vertex set G, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence number. For a bounded exponent group, we prove its power graph is a perfect graph and we determine its clique/chromatic number. Furthermore, it is proved that for every group G, the clique number of the power graph of G is at most countably infinite. We also measure how close the power graph is to the commuting graph by introducing a new graph which lies in between. We call this new graph the enhanced power graph. For an arbitrary pair of these three graphs we...