Related papers: Graphs in the 3--sphere with maximum symmetry

The genus spectrum of a finite group $G$ is the set of all $g\geq 2$ such that $G$ acts faithfully and orientation-preserving on a closed compact orientable surface of genus $g$. This article is an overview of some results relating the…

For a graph $G$, the $\gamma$-graph of $G$, $G(\gamma)$, is the graph whose vertices correspond to the minimum dominating sets of $G$, and where two vertices of $G(\gamma)$ are adjacent if and only if their corresponding dominating sets in…

Let $k$ be a field, and suppose that $\Gamma$ is a smooth $k$-group that acts on a connected, reductive $k$-group $\widetilde G$. Let $G$ denote the maximal smooth, connected subgroup of the group of $\Gamma$-fixed points in $\widetilde G$.…

We consider orientation-preserving actions of a finite group G on the 3-sphere S^3 (and also on Euclidean space R^3). By the geometrization of finite group actions on 3-manifolds, if such an action is smooth then it is conjugate to an…

Given an evolution algebra associated to a connected finite graph $\Gamma$, we exhibit a free action of the group of symmetries of $\Gamma$ on the set of automorphisms of the algebra. This allows us to explicitly describe this set and we…

A set $S$ of vertices in a graph $G(V,E)$ is called a dominating set if every vertex $v\in V$ is either an element of $S$ or is adjacent to an element of $S$. A set $S$ of vertices in a graph $G(V,E)$ is called a total dominating set if…

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…

Call a periodic map $h$ on the closed orientable surface $\Sigma_g$ extendable if $h$ extends to a periodic map over the pair $(S^3, \Sigma_g)$ for possible embeddings $e: \Sigma_g\to S^3$. We determine the extendabilities for all…

For a finite group $G$ the co-prime graph $\Gamma(G)$ is defined as a graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $gcd(o(x),o(y))=1$ where $o(x)$ and $o(y)$ denote the orders of the…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

Let $\Sigma_g (g>1)$ be a closed surface embedded in $S^3$. If a group $G$ can acts on the pair $(S^3, \Sigma_g)$, then we call such a group action on $\Sigma_g$ extendable over $S^3$. In this paper we show that the maximum order of…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

In this paper we consider all orientation-preserving $\mathbb{Z}_{p^2}$-actions on 3-dimensional handlebodies $V_g$ of genus $g>0$ for $p$ an odd prime. To do so, we examine particular graphs of groups $(\Gamma($v$),\mathbf{G(v)})$ in…

For every group $G$, we show that either $G$ has a topologically transitive action on the line $\mathbb R$ by orientation-preserving homeomorphisms, or every orientation-preserving action of $G$ on $\mathbb R$ has a wandering interval.…

We classify all the $2$-arc-transitive strongly regular graphs, and use this classification to study the family of finite $(G,3)$-geodesic-transitive graphs of girth $4$ or $5$ for some group $G$ of automorphisms. For this application we…

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…

In this paper we generalise the notion of visibility from a point in an integer lattice to the setting of graph theory. For a vertex $x$ of a connected graph $G$, we say that a set $S \subseteq V(G)$ is an \emph{$x$-position set} if for any…

We consider the group of isotopy classes of automorphisms of the 3-sphere that preserve a spatial graph or a handlebody-knot embedded in it. We prove that the group is finitely presented for an arbitrary spatial graph or a reducible…

In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…