相关论文: Eigenvalue equation for the modular graph $C_{a,b,…

The class of differential-equation eigenvalue problems $-y''(x)+x^{2N+2}y(x)=x^N Ey(x)$ ($N=-1,0,1,2,3,...$) on the interval $-\infty<x<\infty$ can be solved in closed form for all the eigenvalues $E$ and the corresponding eigenfunctions…

We review the properties of eigenvectors for the graph Laplacian matrix, aiming at predicting a specific eigenvalue/vector from the geometry of the graph. After considering classical graphs for which the spectrum is known, we focus on…

In this paper, we investigate the non-modular solutions to the Schwarz differential equation $\{f,\tau \}=sE_4(\tau)$ where $E_4(\tau)$ is the weight 4 Eisenstein series and $s$ is a complex parameter. In particular, we provide explicit…

In the broad range of studies related to quantum graphs, quantum graph spectra appear as a topic of special interest. They are important in the context of diffusion type problems posed on metric graphs. Theoretical findings suggest that…

In this paper, we aim to address the open questions raised in various recent papers regarding characterization of circulant graphs with three or four distinct eigenvalues in their spectra. Our focus is on providing characterizations and…

Let $G$ be a graph with $n$ vertices and $m$ edges. The energy $E$ of the graph $G$ is defined as the sum of the moduli of the adjacency eigenvalues $\lambda_{1} \geq \lambda_{2} \geq \ldots \geq \lambda_{n}$ of $G$: $$…

We study generating series of torus integrals that contain all so-called modular graph forms relevant for massless one-loop closed-string amplitudes. By analysing the differential equation of the generating series we construct a solution…

Let $G$ be a graph and let $g, f$ be nonnegative integer-valued functions defined on $V(G)$ such that $g(v) \le f(v)$ and $g(v) \equiv f(v) \pmod{2}$ for all $v \in V(G)$. A $(g,f)$-parity factor of $G$ is a spanning subgraph $H$ such that…

We examine the capacity of the complementarity spectrum to distinguish non-isomorphic digraphs. We focus on the seven families with exactly three complementarity eigenvalues. Our findings reveal that in some, but not all families, any two…

We consider nonlinear eigenvalue problems to compute all eigenvalues in a bounded region on the complex plane. Based on domain decomposition and contour integrals, two robust and scalable parallel multi-step methods are proposed. The first…

We consider nonregular graphs having precisely three distinct eigenvalues. The focus is mainly on the case of graphs having two distinct valencies and our results include constructions of new examples, structure theorems, valency…

Given a simple graph $G$, its $A_\alpha$ matrix is a convex combination with parameter $\alpha\in [0,1]$ of its adjacency matrix and its degree diagonal matrices. Here we compare two lower bounds presented in [J. D. G. Silva Jr., C. S.…

We continue the analysis of modular invariant functions, subject to inhomogeneous Laplace eigenvalue equations, that were determined in terms of Poincar\'e series in a companion paper. The source term of the Laplace equation is a product of…

Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…

We introduce and study the conical curvature-dimension condition, $CCD(K,N)$, for graphs. We show that $CCD(K,N)$ provides necessary and sufficient conditions for the underlying graph to satisfy a sharp global Poincar\'e inequality which in…

Let $G$ be a simple undirected graph. For $\alpha \in [0,1]$, let \begin{equation*} A_{\alpha}\left( G\right) =\alpha D\left( G\right) +(1-\alpha)A\left( G\right) , \end{equation*} where $A(G)$ is the adjacency matrix of $G$ and $D(G)$ is…

The inverse eigenvalue problem of a graph $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$. In this work, the inverse eigenvalue problem is completely…

The role of the normalized modularity matrix in finding homogeneous cuts will be presented. We also discuss the testability of the structural eigenvalues and that of the subspace spanned by the corresponding eigenvectors of this matrix. In…

We propose a numerical method for computing all eigenvalues (and the corresponding eigenvectors) of a nonlinear holomorphic eigenvalue problem that lie within a given contour in the complex plane. The method uses complex integrals of the…

An odd $[1,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for each vertex $v \in V(G)$, $d_H(v)$ is odd and $1\le d_H(v) \le b$. Let $\lambda_3(G)$ be the third largest eigenvalue of the adjacency matrix of $G$. For positive…