Related papers: Commuting graphs of inverse semigroups and complet…

Our goal is to find classes of convolution semigroups on Lie groups $G$ that give rise to interesting processes in symmetric spaces $G/K$. The $K$-bi-invariant convolution semigroups are a well-studied example. An appealing direction for…

A graph $G = (V, E)$ is said to be word-representable if a word $w$ can be formed using the letters of the alphabet $V$ such that for every pair of vertices $x$ and $y$, $xy \in E$ if and only if $x$ and $y$ alternate in $w$. A…

We establish analytically several new identities connecting enumerators of different types of circulant graphs of prime, twice prime and prime-squared orders. In particular, it is shown that the semi-sum of the number of undirected…

In this paper, we introduce a method for finding all edge-transitive graphs of small order, using faithful representations of transitive permutation groups of small degree, and we explain how we used this method to find all edge-transitive…

We study two classes of inverse semigroups built from directed graphs, namely graph inverse semigroups and a new class of semigroups that we refer to as Leavitt inverse semigroups. These semigroups are closely related to graph…

In this paper we investigate commuting involution graphs in classical affine Weyl groups. Let $W$ be a classical Weyl group of rank $n$, with $\tilde W$ its corresponding affine Weyl group. Our main result is that if $X$ is a conjugacy…

Let $S$ be a subring of a finite ring $R$ and $C_R(S) = \{r \in R : rs = sr \;\forall\; s \in S\}$. The relative non-commuting graph of the subring $S$ in $R$, denoted by $\Gamma_{S, R}$, is a simple undirected graph whose vertex set is $R…

An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph having m different types of arcs and n different types of edges. A homomorphism of an (m,n)-graph G to another (m,n)-graph H is a vertex mapping that preserves adjacency,…

Vertex coloring of a graph $G$ with $n$-colors can be equivalently thought to be a graph homomorphism (edge preserving vertex mapping) of $G$ to the complete graph $K_n$ of order $n$. So, in that sense, the chromatic number $\chi(G)$ of $G$…

The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…

Let $X$ be a finite set. We determine the diameter of the commuting graph of the partial transformation semigroup $\mathcal{P}(X)$ on $X$ and show that it coincides with the diameter of the commuting graph of the transformation semigroup…

An $(m, n)$-colored mixed graph is a graph having arcs of $m$ different colors and edges of $n$ different colors. A graph homomorphism of an $(m, n$)-colored mixed graph $G$ to an $(m, n)$-colored mixed graph $H$ is a vertex mapping such…

We classify the pairs $(C,G)$ where $C$ is a seminormal curve over an arbitrary field $k$ and $G$ is a smooth connected algebraic group acting faithfully on $C$ with a dense orbit, and we determine the equivariant Picard group of $C$. We…

A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…

In this article we consider a problem related to two famous combinatorial topics. One of them concerns the chromatic number of the space. The other deals with graphs having big girth (the length of the shortest cycle) and large chromatic…

The clique graph $kG$ of a graph $G$ has as its vertices the cliques (maximal complete subgraphs) of $G$, two of which are adjacent in $kG$ if they have non-empty intersection in $G$. We say that $G$ is clique convergent if $k^nG\cong k^m…

Let {\Gamma} be a directed graph and Inv({\Gamma}) be the graph inverse semigroup of {\Gamma}. Luo and Wang [7] showed that the congruence lattice C(Inv({\Gamma})) of any graph inverse semigroup Inv({\Gamma}) is upper semimodular, but not…

In this paper, we study the appearance of a spanning subdivision of a clique in graphs satisfying certain pseudorandom conditions. Specifically, we show the following three results. Firstly, that there are constants $C>0$ and $c\in (0,1]$…

Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…

Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $I(G)$ be its edge ideal in the ring $K[x_0,\ldots,x_{n-1}]$. Under the hypothesis that $n$ is prime we : 1) compute the…