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

A \emph{uniform random intersection graph} $G(n,m,k)$ is a random graph constructed as follows. Label each of $n$ nodes by a randomly chosen set of $k$ distinct colours taken from some finite set of possible colours of size $m$. Nodes are…

We present a construction which shows that there is an infinite set of cyclically 4-edge connected cubic graphs on $n$ vertices with no cycle longer than $c_4 n$ for $c_4=\frac{12}{13}$, and at the same time prove that a certain natural…

Given an admissible map F for a homogeneous network N, it is known that the Jacobian DF(x) around a fully synchronous point x = (x0, ..., x0) is again an admissible map for N. Motivated by this, we study the spectra of linear admissible…

We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the…

We define $2n$-multiwebs on planar graphs and discuss their relation with $\mathrm{Sp}(2n)$-webs. On a planar graph with a symplectic local system we define a matrix whose Pfaffian is the sum of traces of $2n$-multiwebs. As application we…

We study the derangement graph $\Gamma_n$ whose vertex set consists of all permutations of $\{1,\ldots,n\}$, where two vertices are adjacent if and only if their corresponding permutations differ at every position. It is well-known that…

We characterize the spectrum of the Laplacian of graphs composed of one or two finite or infinite chains connected to a complete graph. We show the existence of localized eigenvectors of two types, eigenvectors that vanish exactly outside…

To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in…

We construct explicit families of graphs whose eigenvalues are asymptotically distributed according to Wigner's semicircle law; in other words, that are spectrally indistinguishable from random graphs. However, in other respects they are…

We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…

For a group $G,$ the generating graph of $G,$ denoted by $\Gamma(G).$ We define $Q_n=\langle x,y: x^{2n}=y^4=1, x^n=y^2,y^{-1}xy=x^{-1}\rangle,$ the dicyclic group of order $4n.$ This paper primarily delves into exploring the graph…

We extend the notions of the m-splitting graph Sm(G) and the m-shadow graph Dm(G) to introduce two new graph operations: the (p, q)-generalized splitting graph Sp,q(G) and the (c, k)-shadow-splitting graph Hc,k(G). We derive the adjacency…

S. Bigelow proved that the braid groups are linear. That is, there is a faithful representation of the braid group into the general linear group of some field. Using this, we deduce from previously known results that the mapping class group…

For dendrite graphs from biological experiments on mouse's retinal ganglion cells, a paper by Nakatsukasa, Saito and Woei reveals a mysterious phase transition phenomenon in the spectra of the corresponding graph Laplacian matrices. While…

In a reduction sequence of a graph, vertices are successively identified until the graph has one vertex. At each step, when identifying $u$ and $v$, each edge incident to exactly one of $u$ and $v$ is coloured red. Bonnet, Kim, Thomass\'e…

For a locally finite graph $\Gamma$, we consider its mapping class group $\text{Map}(\Gamma)$ as defined by Algom-Kfir-Bestvina. For these groups, we prove a generalization of the results of Laudenbach and Brendle-Broaddus-Putman, producing…

We define and study the category of symmetric $\mathfrak{sl}_2$-webs. This category is a combinatorial description of the category of all finite dimensional quantum $\mathfrak{sl}_2$-modules. Explicitly, we show that (the additive closure…

In this paper, we study the maximum adjacency spectral radii of graphs of large order that do not contain an even cycle of given length. For $n>k$, let $S_{n,k}$ be the join of a clique on $k$ vertices with an independent set of $n-k$…

In this paper, we obtain two spectral upper bounds for the $k$-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than $k$. We construct graphs that attain equality for our first…

Let $G$ be a connected graph with $V(G)=\{v_1,\ldots,v_n\}$. The $(i,j)$-entry of the distance matrix $D(G)$ of $G$ is the distance between $v_i$ and $v_j$. In this article, using the well-known Ramsey's theorem, we prove that for each…