Related papers: Gain-line graphs via $G$-phases and group represen…

Nonlinear Doebner-Goldin [Phys. Rev. A 54, 3764 (1996)] gauge transformations (NGT) defined in terms of a wave function $\psi(x)$ do not form a group. To get a group property one has to consider transformations that act differently on…

Let $G_n=\mathbb{Z}_n\times \mathbb{Z}_n$ for $n\geq 4$ and $S=\{(i,0),(0,i),(i,i): 1\leq i \leq n-1\}\subset G_n$. Define $\Gamma(n)$ to be the Cayley graph of $G_n$ with respect to the connecting set $S$. It is known that $\Gamma(n)$ is a…

Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…

For an incidence geometry $\mathcal{G} = (\mathcal{P}, \mathcal{L}, \text{I})$ with a linear representation $\mathcal{T}_n^*(\mathcal{K})$, we apply WQH switching to construct a non-geometric graph $\Gamma'$ cospectral with the line graph…

A graph $\Gamma$ is said to be symmetric if its automorphism group $\rm Aut(\Gamma)$ acts transitively on the arc set of $\Gamma$. In this paper, we show that if $\Gamma$ is a finite connected heptavalent symmetric graph with solvable…

Let $G$ be a finite group. For a fixed element $g$ in $G$ and a given subgroup $H$ of $G$, the relative $g$-noncommuting graph of $G$ is a simple undirected graph whose vertex set is $G$ and two vertices $x$ and $y$ are adjacent if $x \in…

We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…

Let $G$ be a group. A group is said to be $k$-generated if it can be generated by its $k$ elements. A generating set of $G$ is called a minimal generating set if no proper subset of it generates $G.$ A minimal generating set of a group can…

The area of Data Analytics on graphs promises a paradigm shift as we approach information processing of classes of data, which are typically acquired on irregular but structured domains (social networks, various ad-hoc sensor networks).…

Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…

Let $\Gamma$ be an Abelian group and let $G$ be a simple graph. We say that $G$ is $\Gamma$-colorable if for some fixed orientation of $G$ and every edge labeling $\ell:E(G)\rightarrow \Gamma$, there exists a vertex coloring $c$ by the…

Inspired by the generation power of generative adversarial networks (GANs) in image domains, we introduce a novel hierarchical architecture for learning characteristic topological features from a single arbitrary input graph via GANs. The…

The representation of graph states in the X-basis as well as the calculation of graph state overlaps can efficiently be performed by using the concept of X-Chains [Phys. Rev. A 92(1) 012322]. We present a necessary and sufficient criterion…

For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a…

Given a graph $G$, we have the adjacency matrix $A(G)$ and degree diagonal matrix $D(G)$. The $Q$-spectrum is the all eigenvalues of $Q$-matrix $Q(G)=A(G)+D(G)$. A class of graphs is determined by their generalized $Q$-spectrum (DGQS for…

The girth of a finitely generated group G is the supremum of the girth of Cayley graphs for G over all finite generating sets. Let G be a finitely generated subgroup of the mapping class group Mod(S), where S is a compact orientable…

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

For any finite group $G$, and any positive integer $n$, we construct an association scheme which admits the diagonal group $D_n(G)$ as a group of automorphisms. The rank of the association scheme is the number of partitions of $n$ into at…

We consider latin square graphs $\Gamma = \rm{LSG}(H)$ of the Cayley table of a given finite group $H$. We characterize all pairs $(\Gamma,G)$, where $G$ is a subgroup of autoparatopisms of the Cayley table of $H$ such that $G$ acts…

The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…