English
Related papers

Related papers: Integral equienergetic non-isospectral unitary Cay…

200 papers

The power graph and the enhanced power graph of a group $\mathbf G$ are simple graphs with vertex set $G$; two elements of $G$ are adjacent in the power graph if one of them is a power of the other, and they are adjacent in the enhanced…

Combinatorics · Mathematics 2024-04-30 Ivica Bošnjak , Rozália Madarász , Samir Zahirović

For any positive integer $k$, let $\mathcal{G}_k$ denote the set of finite groups $G$ such that all Cayley graphs ${\rm Cay}(G,S)$ are integral whenever $|S|\le k$. Est${\rm \acute{e}}$lyi and Kov${\rm \acute{a}}$cs \cite{EK14} classified…

Group Theory · Mathematics 2015-06-18 Xuanlong Ma , Kaishun Wang

In this paper, we characterize the finite groups $G$ of even order with the property that for any involution $x$ and element $y$ of $G$, $\langle x, y \rangle$ is isomorphic to one of the following groups: $\mathbb{Z}_2,$ $\mathbb{Z}_2^2$,…

Group Theory · Mathematics 2021-04-02 Yan-Quan Feng , István Kovács

Let $G$ be a group and $S$ an inverse closed subset of $G\setminus \{1\}$. By a Cayley graph $Cay(G,S)$ we mean the graph whose vertex set is the set of elements of $G$ and two vertices $x$ and $y$ are adjacent if $x^{-1}y\in S$. A group…

Group Theory · Mathematics 2017-10-13 A. Abdollahi , M. Zallaghi

Two graphs having the same spectrum are said to be cospectral. Two graphs such that the absolute values of their nonzero eigenvalues coincide are singularly cospectral graphs. Cospectrality implies singular cospectrality, but the converse…

Combinatorics · Mathematics 2024-08-15 Cristian M. Conde , Ezequiel Dratman , Luciano N. Grippo , Melina Privitelli

In this paper, we give several constructions for the pairs of graphs to be equienergetic and Randic' equienergetic graphs. Also, some new families of integral and Randic' integral graphs are obtained. As an application, a sequence of graphs…

Combinatorics · Mathematics 2021-05-17 T K Jahfar , A V Chithra

Let $G$ be a simple undirected graph, and $G^\phi$ be a mixed graph of $G$ with the generalized orientation $\phi$ and Hermitian-adjacency matrix $H(G^\phi)$. Then $G$ is called the underlying graph of $G^\phi$. The Hermitian energy of the…

Combinatorics · Mathematics 2015-08-14 Xiaolin Chen , Xueliang Li , Yingying Zhang

In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…

Combinatorics · Mathematics 2025-09-03 Xiwang Cao

Let $G$ be a Cayley graph of the elementary abelian $2$-group $\mathbb{Z}_2^{n}$ with respect to a set $S$ of size $d$. We prove that for any such $G, S$ and $d$, the maximum degree of any induced subgraph of $G$ on any set of more than…

Combinatorics · Mathematics 2020-11-10 Noga Alon , Kai Zheng

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

Group Theory · Mathematics 2021-03-29 Peter J. Cameron

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…

Combinatorics · Mathematics 2013-01-10 Philippe Cara , Sara Rottey , Geertrui Van de Voorde

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…

Group Theory · Mathematics 2025-04-22 Mingzhu Chen , Ilya B. Gorshkov , Natalia V. Maslova , Nanying Yang

Graph complements G(n) of cyclic graphs are circulant, vertex-transitive, claw-free, strongly regular, Hamiltonian graphs with a Z(n) symmetry, Shannon capacity 2 and known Wiener and Harary index. There is an explicit spectral zeta…

Combinatorics · Mathematics 2021-01-19 Oliver Knill

Let $R$ be a ring with unity. The graph $\Gamma(R)$ is a graph with vertices as elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if $Ra+Rb=R$. Let $\Gamma_2(R)$ is the subgraph of $\Gamma(R)$ induced by the…

Rings and Algebras · Mathematics 2010-07-21 S. Akbari , M. Habibi , A. Majidinya , R. Manaviyat

In this paper, we initiate the study of spectrum of the commuting graphs of finite non-abelian groups. We first compute the spectrum of this graph for several classes of finite groups, in particular AC-groups. We show that the commuting…

Group Theory · Mathematics 2016-04-26 Jutirekha Dutta , Rajat Kanti Nath

An $(a,b)$-biregular bipartite graph is a bipartite graph with bipartition $(X, Y)$ such that each vertex in $X$ has degree $a$ and each vertex in $Y$ has degree $b$. By the bipartite expander mixing lemma, biregular bipartite graphs have…

Combinatorics · Mathematics 2024-04-11 Dandan Fan , Xiaofeng Gu , Huiqiu Lin

We define super-Cayley graphs over a finite abelian group $G$. Using the theory of supercharacters on $G$, we explain how their spectra can be realized as a super-Fourier transform of a superclass characteristic function. Consequently, we…

Number Theory · Mathematics 2025-08-15 Tung T. Nguyen , Nguyen Duy Tân

In this paper, we study new Cayley graphs over the additive group of Galois rings. First we prove that they are expander graphs by using a Weil-Carlitz-Uchiyama type estimation of character sums for Galois rings. We also show that Cayley…

Combinatorics · Mathematics 2019-03-05 Shohei Satake

In this paper, we consider commuting conjugacy class graph (abbreviated as CCC-graph) of a finite group $G$ which is a graph with vertex set $\{x^G : x \in G \setminus Z(G)\}$ (where $x^G$ denotes the conjugacy class containing $x$) and two…

Group Theory · Mathematics 2024-03-06 Firdous Ee Jannat , Rajat Kanti Nath

A graph $F$ is Ramsey for a pair of graphs $(G,H)$ if any red/blue-coloring of the edges of $F$ yields a copy of $G$ with all edges colored red or a copy of $H$ with all edges colored blue. Two pairs of graphs are called Ramsey equivalent…

Combinatorics · Mathematics 2022-06-09 Simona Boyadzhiyska , Dennis Clemens , Pranshu Gupta , Jonathan Rollin
‹ Prev 1 4 5 6 7 8 10 Next ›