相关论文: Constructions of graphs with any possible two-fold…

Hahn groups endowed with the canonical valuation play a fundamental role in the classification of valued abelian groups. In this paper we study the group of valuation (respectively order) preserving automorphisms of a Hahn group $G$. Under…

We consider voltage digraphs, here referred to as graphs, whose edges are labeled with elements from a given group, and explore their derived graphs. Given two voltage graphs, with voltages in abelian groups, we establish a necessary and…

The present paper constructs unbounded quasimorphisms that are invariant under all automorphisms on free products of more than two factors and on graph products of finitely generated abelian groups. This includes many classes of right…

Let $p$ be an odd prime. From a simple undirected graph $G$, through the classical procedures of Baer (Trans. Am. Math. Soc., 1938), Tutte (J. Lond. Math. Soc., 1947) and Lov\'asz (B. Braz. Math. Soc., 1989), there is a $p$-group $P_G$ of…

We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…

Let $G=(V,E)$ be a graph with the vertex-set $V$ and the edge-set $E$. Let $N(v)$ denote the set of neighbors of the vertex $v$ of $G.$ The graph $G$ is called $ irreducible $ whenever for every $v,w \in V$ if $v \neq w$, then $N(v)\neq…

Let $G$ be a group and $L(G)$ be the set of all subgroups of $G$. We introduce a bipartite graph $\mathcal{B}(G)$ on $G$ whose vertex set is the union of two sets $G \times G$ and $L(G)$, and two vertices $(a, b) \in G \times G$ and $H \in…

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

Given a finite connected simple graph $\Gamma$, and a subgroup $G$ of its automorphism group, a general method for finding all finite abelian regular coverings of $\Gamma$ that admit a lift of each element of $G$ is developed. As an…

The automorphism group of the Galois covering induced by a pluri-canonical generic covering of a projective space is investigated. It is shown that by means of such coverings one obtains, in dimensions one and two, serieses of specific…

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

Let G be a group. The intersection graph G(G) of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G; and there is an edge between two distinct…

We construct explicity the automorphism group of the folded hypercube $FQ_n$ of dimension $n>3$, as a semidirect product of $N$ by $M$, where $N$ is isomorphic to the Abelian group $Z_2^n$, and $M$ is isomorphic to $Sym(n+1)$, the symmetric…

We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…

A bipartite graph $G=(V,E)$ with $V=V_1\cup V_2$ is biregular if all the vertices of each stable set, $V_1$ and $V_2$, have the same degree, $r$ and $s$, respectively. This paper studies difference sets derived from both Abelian and…

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that its automorphism group ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple…

We study the automorphisms of graph products of cyclic groups, a class of groups that includes all right-angled Coxeter and right-angled Artin groups. We show that the group of automorphism generated by partial conjugations is itself a…

The graph isomorphism is to determine whether two graphs are isomorphic. A closely related problem is automorphism detection, where an isomorphism between two graphs is a bijection between their vertex sets that preserves adjacency, and an…

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…