Related papers: The full automorphism groups of general position g…

Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…

Generalized Baumslag-Solitar groups (GBS groups) are groups that act on trees with infinite cyclic edge and vertex stabilizers. Such an action is described by a labeled graph (essentially, the quotient graph of groups). This paper addresses…

The Johnson graph $J(n,i)$ is defined to the graph whose vertex set is the set of all $i$-element subsets of $\{1,\ldots,n\}$, and two vertices are joined whenever the cardinality of their intersection is equal to $i-1$. In Ramras and…

The hyper-star graph $HS(n,k)$ is defined as follows : its vertex-set is the set of $ {0,1} $-sequences of length $n$ with weight $k$, where the weight of a sequence $v$ is the number of $1^,s$ in $v$, and two vertices are adjacent if and…

For a rational map $\phi$ from a metric graph $\varGamma$ to a tropical projective space $\boldsymbol{TP^n}$ defined by a ratio of rational functions $f_1, \ldots, f_{n + 1}$, an automorphism $\sigma$ of $\varGamma$ induces a permutation of…

Let $\Gamma =(V,E)$ be a reflexive relation having a transitive group of automorphisms and let $v\in V.$ Let $F$ be a subset of $V$ with $F\cap \Gamma ^-(v)=\{v\}$. (i) If $F$ is finite, then $| \Gamma (F)\setminus F|\ge |\Gamma (v)|-1.$…

Suppose that $M$ is a closed, connected, and oriented Riemannian $n$-manifold, $f \colon \mathbb{R}^n \to M$ is a quasiregular map automorphic under a discrete group $\Gamma$ of Euclidean isometries, and $f$ has finite multiplicity in a…

An automorphism $\alpha$ of a group $G$ is called a commuting automorphism if each element $x$ in $G$ commutes with its image $\alpha(x)$ under $\alpha$. Let $A(G)$ denote the set of all commuting automorphisms of $G$. Rai [Proc. Japan…

Let $\Gamma=(V,E)$ be a graph. If all the eigenvalues of the adjacency matrix of the graph $\Gamma$ are integers, then we say that $\Gamma$ is an integral graph. A graph $\Gamma$ is determined by its spectrum if every graph cospectral to it…

A pair of graphs $(\Gamma,\Sigma)$ is said to be stable if the full automorphism group of $\Gamma\times\Sigma$ is isomorphic to the product of the full automorphism groups of $\Gamma$ and $\Sigma$ and unstable otherwise, where…

We call a flag variety admissible if its automorphism group is the projective general linear group. (This holds in most cases.) Let $K$ be a field of characteristic $0$, containing all roots of unity. Let the $K$-variety $X$ be a form of an…

Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

The power graph of a group is the graph whose vertex set is the set of nontrivial elements of group, two elements being adjacent if one is a power of the other. We introduce some way for find the automorphism groups of some graphs. As an…

A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are…

We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph…

Two vertices $u$ and $v$ of a graph $\Gamma$ are strucuturally equivalent if and only if the transposition $(u\,v)$ is in Aut($\Gamma$), the automorphism group of $\Gamma$. Some properties of structural equivalence and the group of vertex…

Given graphs $X$ and $Y$ with vertex sets $V(X)$ and $V(Y)$ of the same cardinality, we define a graph $\mathsf{FS}(X,Y)$ whose vertex set consists of all bijections $\sigma:V(X)\to V(Y)$, where two bijections $\sigma$ and $\sigma'$ are…

A graph $\Gamma$ is a bi-Cayley graph over a group $G$ if $G$ is a semiregular group of automorphisms of $\Gamma$ having two orbits. Let $G$ be a non-abelian metacyclic $p$-group for an odd prime $p$, and let $\Gamma$ be a connected…