Related papers: Perfect commuting graphs
We prove that the first homology group of every planar locally transitive finite graph $G$ is a finitely generated ${\rm Aut}(G)$-module and we prove a similar result for the fundamental group of locally finite planar Cayley graphs.…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
Carrier graphs of groups representing subgroups of a given relatively hyperbolic groups are introduced and a combination theorem for relatively quasi-convex subgroups is proven. Subsequently a theory of folds for such carrier graphs is…
We extend the notion of a commuting poset for a finite group to p-blocks and fusion systems, and we generalize a result, due originally to Alperin and proved independently by Aschbacher and Segev, to commuting graphs of blocks, with a very…
In this paper, we construct a family of quasi-strongly regular Cayley graphs $\Gamma_H(G)$ which is defined on a finite group $G$ with respect to a subgroup $H$ of $G$. We also compute its full automorphism group and characterize various…
We construct a family of finite special 2-groups which have commuting graph of increasing diameter
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
The commuting graph of a non-commutative ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R\setminus Z(R)$ and two vertices $x, y$ are adjacent if and only if $xy = yx$. In this paper, we compute the spectrum…
The aim of this paper is to see how commuting graphs interact with two semigroup constructions: the zero-union and the direct product. For both semigroup constructions, we investigate the diameter, clique number, girth, chromatic number and…
In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…
Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…
In this paper we first show that among all double-toroidal and triple-toroidal finite graphs only $K_8 \sqcup 9K_1$, $K_8 \sqcup 5K_2$, $K_8 \sqcup 3K_4$, $K_8 \sqcup 9K_3$, $K_8\sqcup 9(K_1 \vee 3K_2)$, $3K_6$ and $3K_6 \sqcup 4K_4 \sqcup…
We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.
Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…
The study of perfect state transfer on graphs has attracted a great deal of attention during the past ten years because of its applications to quantum information processing and quantum computation. Perfect state transfer is understood to…
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…
We show that smooth well formed weighted complete intersections have finite automorphism groups, with several obvious exceptions.
Let $f \colon X \to Y$ be a morphism of concentrated schemes. We characterize $f$-perfect complexes $\mathcal{E}$ as those such that the functor $\mathcal{E} \otimes^{\mathbf{L}}_X \mathbf{L} f^*-$ preserves bounded complexes. We prove, as…
We define cofinite graphs and cofinite groupoids in a unified way that extends the notion of cofinite groups introduced by Hartley. The common underlying structure of all these objects is that they are directed graphs endowed with a certain…
The well-known characterization of two-ended groups says that every two-ended group can be split over finite subgroups which means it is isomorphic to either by a free product with amalgamation $A\ast_C B$ or an HNN-extension $\ast_{\phi}…