Related papers: A proof of the polycirculant conjecture
We introduce the notion of orbit equivalence of directed graphs, following Matsumoto's notion of continuous orbit equivalence for topological Markov shifts. We show that two graphs in which every cycle has an exit are orbit equivalent if…
An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes…
The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…
A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…
We consider a finite, connected and simple graph $\Gamma$ that admits a vertex-transitive group of automorphisms $G$. Under the assumption that, for all $x \in V(\Gamma)$, the local action $G_x^{\Gamma(x)}$ is the action of…
Let $G_{g,b}$ be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface of genus $g$ with $b$ boundary components. We describe the set $A_{g,b}$ of all automorphisms of…
In the present work we prove that given any two unicycle graphs (pseudoforests) that share the same degree sequence there is a finite sequence of 2-switches transforming one into the other such that all the graphs in the sequence are also…
We characterise connected cubic graphs admitting a vertex- transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a…
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…
A circulant (di)graph is a (di)graph on n vertices that admits a cyclic automorphism of order n. This paper provides a survey of the work that has been done on finding the automorphism groups of circulant (di)graphs, including the…
An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…
We prove that, if $\Gamma$ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of $\Gamma$ of order at least $6$, or the number of vertices of $\Gamma$ is bounded above by an absolute…
In this paper we investigate orders, longest cycles and the number of cycles of automorphisms of finite vertex-transitive graphs. In particular, we show that the order of every automorphism of a connected vertex-transitive graph with $n$…
We prove that every recurrent graph $G$ quasi-isometric to $\mathbb{R}$ admits an essentially unique Lipschitz harmonic function $h$. If $G$ is vertex-transitive, then the action of $Aut(G)$ preserves $\partial h$ up to a sign, a fact that…
The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…
A graph admitting an automorphism with two orbits of the same length is called a bicirculant. Recently, Jajcay et al. initiated the investigation of the edge-transitive bicirculants with the properties that one of the subgraphs induced by…
A mixed graph $G$ is a graph obtained from a simple undirected graph by orientating a subset of edges. $G$ is self-converse if it is isomorphic to the graph obtained from $G$ by reversing each directed edge. For two mixed graphs $G$ and $H$…
A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…
For a graph $G$ and a positive integer $k$, a vertex labelling $f:V(G)\to\{1,2\ldots,k\}$ is said to be $k$-distinguishing if no non-trivial automorphism of $G$ preserves the sets $f^{-1}(i)$ for each $i\in\{1,\ldots,k\}$. The…
Let $S$ be a (topological) compact closed surface of genus two. We associate to each translation surface $(X,\omega) \in \mathcal{H}(2)\sqcup\mathcal{H}(1,1)$ a subgraph $\hat{\mathcal{C}}_{\rm cyl}$ of the curve graph of $S$. The vertices…