Related papers: $PI$-eigenfunctions of the Star graphs
Let us denote elements of the symmetric group $S_n$ using square brackets for the one-line notation. Cycles will be represented using parentheses, following the standard cycle notation. Under this convention, the full reversal of the…
We compute the homology of the matching complex $M(\Gamma)$, where $\Gamma$ is the complete hypergraph on $n\geq 2$ vertices, and analyse the $S_n$-representations carried by this homology. These results are achieved using standard…
Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be…
We completely describe all integer symmetric matrices that have all their eigenvalues in the interval [-2,2]. Along the way we classify all signed graphs, and then all charged signed graphs, having all their eigenvalues in this same…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
The Cayley sum graph $\Gamma_S$ of a set $S \subseteq \mathbb{Z}_n$ is defined on the vertex set $\mathbb{Z}_n$, with an edge between distinct $x, y \in \mathbb{Z}_n$ if $x + y \in S$. Campos, Dahia, and Marciano have recently shown that if…
A signed graph $\Sigma = (G, \sigma)$ is a graph where the function $\sigma$ assigns either $1$ or $-1$ to each edge of the simple graph $G$. The adjacency matrix of $\Sigma$, denoted by $A(\Sigma)$, is defined canonically. In a recent…
A mixed graph is said to be HS-\emph{integral} if the eigenvalues of its Hermitian-adjacency matrix of the second kind are integers. A mixed graph is called \emph{Eisenstein integral} if the eigenvalues of its (0, 1)-adjacency matrix are…
This paper presents a family of Fourier eigenfunctions indexed by the space dimension d. These eigenfunctions are radial and built upon some generalized exponential integral function. For d=1,2,3, they are integrable or square integrable…
We study a family of non-local isoperimetric energies $E_{\gamma,\varepsilon}$ on the round sphere $M = S^n$, where the non-local interaction kernel $K_\varepsilon$ is the fundamental solution of the Helmholtz operator $1 - \varepsilon^2…
For any graph $G$ on $n$ vertices and for any {\em symmetric} subgraph $J$ of $K_{n,n}$, we construct an infinite sequence of graphs based on the pair $(G,J)$. The First graph in the sequence is $G$, then at each stage replacing every…
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…
All graphs considered are simple and undirected. The Inverse Eigenvalue Problem of a Graph $G$ (IEP-G) aims to find all possible spectra for matrices whose $(i,j)-$entry, for $i\neq j$, is nonzero precisely when $i$ is adjacent to $j$. A…
We study when the adjacency matrix of a Cayley graph factors as the product of two adjacency matrices of Cayley graphs. Let $G$ be a finite group and let $U\subseteq G\setminus \{e\}$ be symmetric. Writing $A(G;U)$ for the adjacency matrix…
Using the analytical expressions for the genuine eigenfunctions $\varphi_{\mu\nu}(z)$ and eigenvalues $E_{\mu,\nu}$, of open, bounded and quasi-bounded finite periodic systems, we derive the eigenfunctions space-inversion symmetry…
Quasi-strongly regular graphs form a significant generalization of strongly regular graphs. We study the eigenvalues of a family of such graphs, $\Gamma_H(G)$, constructed from a finite group $G$ and a subgroup $H$. Our main results include…
Let $\Pi$ be a polar space of rank $n$ and let ${\mathcal G}_{k}(\Pi)$, $k\in \{0,\dots,n-1\}$ be the polar Grassmannian formed by $k$-dimensional singular subspaces of $\Pi$. The corresponding Grassmann graph will be denoted by…
We study planar graphs with large negative curvature outside of a finite set and the spectral theory of Schr{\"o}dinger operators on these graphs. We obtain estimates on the first and second order term of the eigenvalue asymptotics.…
The set $S_{\{i,j\}_{n}^{m}}=\{0,1,2,\ldots,m-1,m,m,m+1,\ldots,n-1,n\}\setminus\{i,j\},\quad 0<i<j\leqslant n$, is called Laplacian realizable if there exists a simple connected graph $G$ whose Laplacian spectrum is $S_{\{i,j\}_{n}^{m}}$.…
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…