Related papers: Weakly nil clean graphs of rings
The number of the positive, negative and zero eigenvalues in the spectrum of the (edge)-weighted graph $G$ are called positive inertia index, negative inertia index and nullity of the weighted graph $G$, and denoted by $i_+(G)$, $i_-(G)$,…
We say that a digraph is essentially cyclic if its Laplacian spectrum is not completely real. The essential cyclicity implies the presence of directed cycles, but not vice versa. The problem of characterizing essential cyclicity in terms of…
In the mid-1990s, Stanley and Stembridge conjectured that the chromatic symmetric functions of claw-free co-comparability (also called incomparability) graphs were e-positive. The quest for the proof of this conjecture has led to an…
The annihilating-ideal graph of a commutative ring $R$ with unity is defined as the graph $\mathbb{AG}(R)$ with the vertex set is the set of all non-zero ideals with non-zero annihilators and two distinct vertices $I$ and $J$ are adjacent…
Suppose that $F$ is a finite field and $R=M_n(F)$ is the ring of $n$-square matrices over $F$. Here we characterize when the Cayley graph of the additive group of $R$ with respect to the set of invertible elements of $R$, called the unitary…
A new algorithm to obtain the chromatic number of a finite, connected graph is proposed in this paper. The algorithm is based on contraction of non adjacent vertices.
Link residual closeness is a newly proposed measure for network vulnerability. In this model, vertices are perfectly reliable and the links fail independently of each other. It measures the vulnerability even when the removal of links does…
The power graph of a group is the simple graph whose vertices are the group elements and two vertices are adjacent whenever one of them is a positive power of the other. We characterize the finite nilpotent groups whose power graphs have…
Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…
Concerning the recent notion of circular chromatic number of signed graphs, for each given integer $k$ we introduce two signed bipartite graphs, each on $2k^2-k+1$ vertices, having shortest negative cycle of length $2k$, and the circular…
A ring is clean (resp. almost clean) if each of its elements is the sum of a unit (resp. regular element) and an idempotent. In this paper we define the analogous notion for *-rings: a *-ring is *-clean (resp. almost *-clean) if its every…
We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…
The theory of colorful graphs can be developed by working in Galois field modulo (p), p > 2 and a prime number. The paper proposes a program of possible conversion of graph theory into a pleasant colorful appearance. We propose to paint the…
We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of R and two vertices are adjacent if their product is zero. The compressed zero divisor graph $\Gamma_E[R]$ is…
We introduce the concept of weight graph for the weight system $P\frak{g}(T)$ of a finite dimensional nilpotent Lie algebra $\frak{g}$ and analyze the necessary conditions for a $(p,q)$-graph to be a weight graph for some $\frak{g}$.
Let $R$ be a finite ring and $r\in R$. The $r$-noncommuting graph of $R$, denoted by $\Gamma_R^r$, is a simple undirected graph whose vertex set is $R$ and two vertices $x$ and $y$ are adjacent if and only if $[x,y] \neq r$ and $-r$. In…
We consider quantum search on graphs. Recently, it has been shown that the graph properties like connectivity, global symmetry, or regularity cannot serve as a reliable criteria that must be satisfied by a graph to allow a successful…
Let $R$ be a commutative ring and ${\Bbb{A}}(R)$ be the set of ideals with non-zero annihilators. The annihilating-ideal graph of $R$ is defined as the graph ${\Bbb{AG}}(R)$ with vertex set ${\Bbb{A}}(R)^*={\Bbb{A}}\setminus\{(0)\}$ such…