Related papers: The binary actions of alternating groups

Given a self-similar groupoid action $(G,E)$ on a finite directed graph, we prove some properties of the corresponding ample groupoid of germs $\mathcal G(G,E)$. We study the analogue of the Higman-Thompson group associated to $(G,E)$ using…

Let $G$ be a finite non-abelian group. The non-commuting graph $\Gamma_G$ of $G$ has the vertex set $G\setminus Z(G)$ and two distinct vertices $x$ and $y$ are adjacent if $xy\ne yx$, where $Z(G)$ is the center of $G$. We prove that the…

An alternative foundation for 2-categories is explored by studying graph-theoretically a partial operation on 2-cells named juncture, which can replace vertical and horizontal composition. Juncture is a generalized vertical composition of…

We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

We consider a crossed product of a unital simple separable nuclear stably finite Z-stable C*-algebra A by a strongly outer cocycle action of a discrete countable amenable group \Gamma. Under the assumption that A has finitely many extremal…

Let $\Gamma$ be a finite X-symmetric graph with a nontrivial X-invariant partition $\mathcal {B}$ on $V(\Gamma)$ such that $\Gamma_{\mathcal {B}}$ is a connected (X,2)-arc-transitive graph and $\Gamma$ is not a multicover of…

For each positive integer $n$, the Fibonacci-sum graph $G_n$ on vertices $1,2,\ldots,n$ is defined by two vertices forming an edge if and only if they sum to a Fibonacci number. It is known that each $G_n$ is bipartite, and all Hamiltonian…

Let $\Gamma$ be a finitely generated torsion free nilpotent group, and let $A^\omega$ be the space of infinite words over a finite alphabet $A$. We investigate two types of self-similar actions of $\Gamma$ on $A^\omega$, namely the…

Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…

We introduce a revised notion of gauge action in relation with Leavitt path algebras. This notion is based on group schemes and captures the full information of the grading on the algebra as it is the case of the gauge action of the graph…

Let $G = (V, E)$ be a graph and $\lambda $ a non-negative integer. A graph $G$ is called a $(\lambda, 1)$-{\em graph} if $ (c0)$ $G$ is neither a complete graph no an edge-empty graph, $ (c1)$ every edge in $G$ belongs to exactly $\lambda$…

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…

For a group $G$, the generating graph $\Gamma(G)$ is defined as the graph with the vertex set $G$, and any two distinct vertices of $\Gamma(G)$ are adjacent if they generate $G$. In this paper, we study the generating graph of $D_n,$ where…

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…

Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…

Given an automorphism $\phi:\Gamma\to \Gamma$, one has an action of $\Gamma$ on itself by $\phi$-twisted conjugacy, namely, $g.x=gx\phi(g^{-1})$. The orbits of this action are called $\phi$-twisted conjugacy classes. One says that $\Gamma$…

A graph $G(V,E)$ is $\Gamma$-harmonious when there is an injection $f$ from $V$ to an Abelian group $\Gamma$ such that the induced edge labels defined as $w(xy)=f(x)+f(y)$ form a bijection from $E$ to $\Gamma$. We study $\Gamma$-harmonious…

A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…

For any graph $G$ on $n$ vertices and for any {\em symmetric} subgraph $J$ of $K_{n,n}$, we construct an infinite sequence of graphs based on the pair $(G,J)$. The First graph in the sequence is $G$, then at each stage replacing every…