Related papers: Flexibility of eigenvalues for graph Laplacians ar…
For a simple graph on $n$ vertices, any of its signless Laplacian eigenvalues is in the interval $[0, 2n-2]$. In this paper, we give relationships between the number of signless Laplacian eigenvalues in specific intervals in $[0, 2n-2]$ and…
Let $G$ be a connected graph of order $n$ with girth $g$. For $k=1,\dots,\min\{g-1, n-g\}$, let $n(G,k)$ be the number of Laplacian eigenvalues (counting multiplicities) of $G$ that fall inside the interval $[n-g-k+4,n]$. We prove that if…
We propose the notion of normalized Laplacian matrix $\mathcal{L}(\Phi)$ for a gain graphs and study its properties in detail, providing insights and counterexamples along the way. We establish bounds for the eigenvalues of…
The purpose of this paper is to explore the asymptotics of the eigenvalue spectrum of the Laplacian on 2 dimensional spaces of constant curvature, giving strong experimental evidence for a conjecture of the second author…
Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…
Let $H=(V,E)$ be an $r$-uniform hypergraph with the vertex set $V$ and the edge set $E$. For $1\leq s \leq r/2$, we define a weighted graph $G^{(s)}$ on the vertex set ${V\choose s}$ as follows. Every pair of $s$-sets $I$ and $J$ is…
We determine, for all genus $g\geq2$ the Riemann surfaces of genus $g$ with $4g$ automorphisms. For $g\neq$ $3,6,12,15$ or $30$, this surfaces form a real Riemann surface $\mathcal{F}_{g}$ in the moduli space $\mathcal{M}_{g}$: the Riemann…
We show that the automorphism group of the complex of pants decompositions for a surface is isomorphic to the mapping class group for that surface.
The independence complex of a graph $G=(V,E)$ is the simplicial complex $I(G)$ on vertex set $V$ whose simplices are the independent sets in $G$. We present new lower bounds on the eigenvalues of the $k$-dimensional Laplacian $L_k(I(G))$ in…
The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we determine…
Given a finite simple graph $\cG$ with $n$ vertices, we can construct the Cayley graph on the symmetric group $S_n$ generated by the edges of $\cG$, interpreted as transpositions. We show that, if $\cG$ is complete multipartite, the…
This paper establishes new eigenvalue bounds for combinatorial Laplacians of simplicial complexes, extending previous results for flag complexes by Lew (2024) and general complexes by Shukla and Yogeshwaran (2020). Using elementary…
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
Laplacian matrices of weighted graphs in surfaces $S$ are used to define module and polynomial invariants of $Z/2$-homologically trivial links in $S \times [0,1]$. Information about virtual genus is obtained.
For any Riemannian metric $ds^2$ on a compact surface of genus $g$, Yang and Yau proved that the normalized first eigenvalue of the Laplacian $\lambda_1(ds^2)Area(ds^2)$ is bounded in terms of the genus. In particular, if $\Lambda_1(g)$ is…
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…
We characterize all graphs for which there are eigenvectors of the graph Laplacian having all their components in {-1,+1} or {-1,0,+ 1}. Graphs having eigenvectors with components in {-1,+1} are called bivalent and are shown to be the…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
Given a Riemannian surface, we consider a naturally embedded graph which captures part of the topology and geometry of the surface. By studying this graph, we obtain results in three different directions. First, we find bounds on the…