Related papers: Commuting involution graphs for $\tilde C_n$

The problem of inner vs outer conjugacy of subalgebras of certain graph C*-algebras is investigated. For a large class of finite graphs E, we show that whenever $\alpha$ is a vertex-fixing quasi-free automorphism of the corresponding graph…

We study quantum automorphism group of vertex-transitive graphs using intertwinner spaces of the magic unitary matrix associated to this quantum subgroups of $S_n^+$. We also give some applications to quantum symmetries of circulant graphs…

The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…

In this paper we introduce the graph $\Gamma_{sc}(G)$ associated with a group $G$, called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of $G$ and two distinct conjugacy…

We consider commuting pairs of holomorphic endomorphisms of P^2 with disjoint sequence of iterates. The remaining case to be studied is when their degrees coincide after some number of iterations. We show in this case that they are either…

Integral circulant graphs are proposed as models for quantum spin networks that permit a quantum phenomenon called perfect state transfer. Specifically, it is important to know how far information can potentially be transferred between…

We present four models for a random graph and show that, in each case, the probability that a graph is intrinsically knotted goes to one as the number of vertices increases. We also argue that, for $k \geq 18$, most graphs of order $k$ are…

According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…

In this paper we study random induced subgraphs of Cayley graphs of the symmetric group induced by an arbitrary minimal generating set of transpositions. A random induced subgraph of this Cayley graph is obtained by selecting permutations…

An analysis is given of $*$-representations of rank 2 single vertex graphs. We develop dilation theory for the non-selfadjoint algebras $\A_\theta$ and $\A_u$ which are associated with the commutation relation permutation $\theta$ of a 2…

For any two root subsets associated with two Carter diagrams that have the same $ADE$ type and the same size, we construct the transition matrix that maps one subset to the other. The transition between these two subsets is carried out in…

The orbital diameter of a primitive permutation group is the maximal diameter of its orbital graphs. There has been a lot of interest in bounds for the orbital diameter. In this paper we provide explicit bounds on the diameters of groups of…

Let $\mathcal H$ be a finite connected undirected graph and $\mathcal H_{walk}$ be the graph of bi-infinite walks on $\mathcal H$; two such walks $\{x_i\}_{i\in \mathbb Z}$ and $\{y_i\}_{i \in \mathbb Z}$ are said to be adjacent if $x_i$ is…

The Weyl group of the Cuntz algebra O_n, with n finite, is investigated. This is (isomorphic to) the group of polynomial automorphisms of O_n, namely those induced by unitaries that can be written as finite sums of words in the canonical…

This study is the $10^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. In this part, we obtain families of Type-2 isomorphic circulant graphs $C_{np^3}(R)$ w.r.t. $m$ = $p$, and…

In 2019, investigation of the so-called factor-invariant cubic graphs was initiated by Alspach, Khodadadpour and Kreher. For a cubic graph $\Gamma$ and a vertex-transitive subgroup $G$ of $\mathrm{Aut}(\Gamma)$, a $2$-factor $\mathcal{C}$…

This paper discusses properties of the graphs of 2-way and 3-way transportation polytopes, in particular, their possible numbers of vertices and their diameters. Our main results include a quadratic bound on the diameter of axial 3-way…

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs or graphs called multidimensional circulants, which turn out to be Cayley (di)graphs of Abelian groups. This paper is mainly devoted to show…

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…