English
Related papers

Related papers: Lamplighter groups, de Bruijn graphs, spider-web g…

200 papers

One of the most interesting problems on maximum nullity (minimum rank) is to characterize $M(\mathcal{G})$ ($mr(\mathcal{G})$) for a graph $\mathcal{G}$. In this regard, many researchers have been trying to find an upper or lower bound for…

Combinatorics · Mathematics 2017-05-30 Ebrahim Vatandoost , Yasser Golkhandy Pour

Recently in graph theory several authors have studied the spectrum of the Cayley graph of the symmetric group S_n generated by the transpositions (1, i) for 2 <= i <= n. Several conjectures were made and partial results were obtained. The…

Combinatorics · Mathematics 2012-02-28 Guillaume Chapuy , Valentin Féray

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

Given a finitely generated amenable group $H$ satisfying some mild assumptions, we relate isoperimetric profiles of the lampshuffler group $\mathsf{Shuffler}(H)=\mathsf{FSym}(H)\rtimes H$ to those of $H$. Our results are sharp for all…

Group Theory · Mathematics 2026-04-17 Corentin Correia , Vincent Dumoncel

Let S be a fixed finite symmetric subset of SL_d(Z), and assume that it generates a Zariski-dense subgroup G. We show that the Cayley graphs of pi_q(G) with respect to the generating set pi_q(S) form a family of expanders, where pi_q is the…

Group Theory · Mathematics 2012-05-15 Jean Bourgain , Péter P. Varjú

We explore the geometry of the Cayley graphs of the lamplighter groups and a wide range of wreath products. We show that these groups have dead end elements of arbitrary depth with respect to their natural generating sets. An element $w$ in…

Group Theory · Mathematics 2018-03-19 Sean Cleary , Jennifer Taback

In a recent paper Gunnells, Scott and Walden have determined the complete spectrum of the Schreier graph on the symmetric group corresponding to the Young subgroup $S_{n-2}\times S_2$ and generated by initial reversals. In particular they…

Combinatorics · Mathematics 2009-11-11 Filippo Cesi

Let ${G}$ be a finite non-abelian group. The non-commuting conjugacy class graph (abbreviated as NCCC-graph) of $G$ is a simple undirected graph whose vertex set is the set of conjugacy classes of non-central elements of $G$ and two…

Combinatorics · Mathematics 2025-08-28 Rishabh Chakraborty , Firdous Ee Jannat , Rajat Kanti Nath

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…

Combinatorics · Mathematics 2021-07-21 Bilal A. Rather

Consider a group $\mathbb{G}$ and construct its power graph, whose vertex set consists of the elements of $\mathbb{G}$. Two distinct vertices (elements) are adjacent in the graph if and only if one element can be expressed as an integral…

Spectral Theory · Mathematics 2026-03-03 Priti Prasanna Mondal , Basit Auyoob Mir , Fouzul Atik

Let $N_{g,s}$ denote the nonorientable surface of genus g with s boundary components. Recently Paris and Szepietowski obtained an explicit finite presentation for the mapping class group $M(N_{g,s})$ of the surface $N_{g,s}$, where…

Geometric Topology · Mathematics 2016-08-18 Michal Stukow

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…

Combinatorics · Mathematics 2021-12-07 G. Arunkumar , Peter J. Cameron , Rajat Kanti Nath , Lavanya Selvaganesh

Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its tree to a caterpillar. As a corollary of known theorems, for each $k$, there is a finite obstruction set $\mathcal{O}_k$ of graphs such that…

Combinatorics · Mathematics 2014-09-10 Jisu Jeong , O-joung Kwon , Sang-il Oum

In this article, following [A.~Daneshgar, M.~Hejrati, M.~Madani, {\it On cylindrical graph construction and its applications}, EJC, 23(1) p1.29, 45, 2016] we study the spectra of symmetric cylindrical constructs, generalizing some…

Combinatorics · Mathematics 2016-10-11 Amir Daneshgar , Ali Taherkhani

We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two…

Combinatorics · Mathematics 2020-05-11 Adam Timar

Let $G$ be a finite group, and $S$ be a subset of $G\setminus\{1\}$ such that $S=S^{-1}$. Suppose that $Cay(G,S)$ is the Cayley graph on $G$ with respect to the set $S$ which is the graph whose vertex set is $G$ and two vertices $a,b\in G$…

Combinatorics · Mathematics 2015-05-05 Alireza Abdollahi , Shahrooz Janbaz , Mojtaba Jazaeri

We describe the complete spectra of Laplacian, signless Laplacian, and adjacency matrices associated with the commuting graphs of a finite group using group theoretic information. We provide a method to find the center of a group by only…

General Mathematics · Mathematics 2023-05-09 Gargi Ghosh , Samiron Parui

In this paper, we compute the Laplacian spectrum of non-commuting graphs of some classes of finite non-abelian groups. Our computations reveal that the non-commuting graphs of all the groups considered in this paper are L-integral. We also…

Group Theory · Mathematics 2017-05-04 Parama Dutta , Jutirekha Dutta , Rajat Kanti Nath

In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological…

Combinatorics · Mathematics 2015-06-11 Francesc Comellas , Alicia Miralles , Hongxiao Liu , Zhongzhi Zhang

A T-net of order $m$ is a graph with $m$ nodes and $2m$ directed edges, where every node has indegree and outdegree equal to $2$. (A well known example of T-nets are de Bruijn graphs.) Given a T-net $N$ of order $m$, there is the so called…

Combinatorics · Mathematics 2022-04-22 Josef Rukavicka