Related papers: Automorphisms of trivalent graphs

A map on a group into itself is called a local automorphism if at any two points of the group, it can be interpolated by an automorphism of that group. In this paper we investigate the question of how local automorphisms of some classical…

We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…

The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu…

Let $S$ be a set of transpositions generating the symmetric group $S_n$. The transposition graph of $S$ is defined to be the graph with vertex set $\{1,\ldots,n\}$, and with vertices $i$ and $j$ being adjacent in $T(S)$ whenever $(i,j) \in…

We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges…

We prove a tropical analogue of the theorem of Hurwitz: a leafless metric graph of genus $g \ge 2$ has at most $12$ automorphisms when $g = 2$; $2^g g!$ automorphisms when $g \ge 3$. These inequalities are optimal; for each genus, we give…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

Let $S$ be a (compact)\ Riemann surface of genus greater than one. Two automorphism of $S$ are topologically equivalent if they are conjugated by a homeomorphism. The topological classification of automorphisms is a classical problem and…

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…

Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…

It is known that an automorphism of $F_g$, the oriented closed surface of genus $g$, is extendable over the 4-sphere $S^4$ if and only if it has a bounding invariant spin structure \cite{WsWz}. We show that each automorphism of $F_g$ has an…

Two distinct projections of finite rank $m$ are adjacent if their difference is an operator of rank two or, equivalently, the intersection of their images is $(m-1)$-dimensional. We extend this adjacency relation on other conjugacy classes…

The structure of a certain subgroup $S$ of the automorphism group of a partially commutative group (RAAG) $G$ is described in detail: namely the subgroup generated by inversions and elementary transvections. We define admissible subsets of…

Let $\Omega$ be a $m$-set, where $m>1$, is an integer. The Hamming graph $H(n,m)$, has $\Omega ^{n}$ as its vertex-set, with two vertices are adjacent if and only if they differ in exactly one coordinate. In this paper, we provide a proof…

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…

A corner in a map is an edge-vertex-edge triple consisting of two distinct edges incident to the same vertex. A corneration is a set of corners that covers every arc of the map exactly once. Cornerations in a dart-transitive map generalize…

The subspace sum graph $\mathcal{G}(\mathbb{V})$ on a finite dimensional vector space $\mathbb{V}$ was introduced by Das [Subspace Sum Graph of a Vector Space, arXiv:1702.08245], recently. The vertex set of $\mathcal{G}(\mathbb{V})$…

A mixed graph is a set of vertices together with an edge set and an arc set. An $(m,n)$-mixed graph $G$ is a mixed graph whose edges are each assigned one of $m$ colours, and whose arcs are each assigned one of $n$ colours. A \emph{switch}…

Let $G\subset GL_n(k)$ be a finite subgroup and $k[x_1,\dots, x_n]^G\subset k[x_1,\dots, x_n]$ its ring of invariants. We show that, in many cases, the automorphism group of $k[x_1,\dots, x_n]^G$ is $k^\times$. Version 2: Incorporates parts…

For a $2$-connected graph $G$ and vertices $u,v$ of $G$ we define an abstract graph $\mathcal{P}(G_{uv})$ whose vertices are the paths joining $u$ and $v$ in $G$, where paths $S$ and $T$ are adjacent if $T$ is obtained from $S$ by replacing…