Related papers: Oscillation of graph eigenfunctions

We introduce two novel evolutionary formulations of the problem of coloring the nodes of a graph. The first formulation is based on the relationship that exists between a graph's chromatic number and its acyclic orientations. It views such…

Suppose that $\Gamma=(G, \sigma)$ is a connected signed graph with at least one cycle. The number of positive, negative and zero eigenvalues of the adjacency matrix of $\Gamma$ are called positive inertia index, negative inertia index and…

Uncertainty principles present an important theoretical tool in signal processing, as they provide limits on the time-frequency concentration of a signal. In many real-world applications the signal domain has a complicated irregular…

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 initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe vertices such that the non-probe vertices form an independent…

Let m and r be two integers. Let G be a connected r-regular graph of order n and k an integer depending on m and r. For even kn, we find a best upper bound (in terms of r and m) on the third largest eigenvalue that is sufficient to…

We present a comprehensive treatment of relative oscillation theory for finite Jacobi matrices. We show that the difference of the number of eigenvalues of two Jacobi matrices in an interval equals the number of weighted sign-changes of the…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

An eigenvalue of a graph $G$ is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected tricyclic graphs with exactly two main eigenvalues are determined.

An eigenvalue of a graph $G$ is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected tricyclic graphs with exactly two main eigenvalues are determined.

We consider a compact perturbation $H_0 = S + K_0^* K_0$ of a self-adjoint operator $S$ with an eigenvalue $\lambda^\circ$ below its essential spectrum and the corresponding eigenfunction $f$. The perturbation is assumed to be "along" the…

For the Odd Cycle Transversal problem, the task is to find a small set $S$ of vertices in a graph that intersects every cycle of odd length. The Subset Odd Cycle Transversal problem requires S to intersect only those odd cycles that include…

Let $G$ be a simple connected graph. We use $n(G)$, $p(G)$, and $\eta(G)$ to denote the number of negative eigenvalues, positive eigenvalues, and zero eigenvalues of the adjacency matrix $A(G)$ of $G$, respectively. In this paper, we prove…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

The complex eigenvalues of Markov generators govern oscillatory properties of relaxation, autocorrelation, and linear response. Here we show that these eigenvalues are localized by nonequilibrium cycles of the generator, thus revealing a…

We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…

Suppose that $\Gamma=(V,E)$ is a graph with vertices $V$, edges $E$, a free group action on the vertices $\mathbb{Z}^d \curvearrowright V$ with finitely many orbits, and a linear operator $D$ on the Hilbert space $l^2(V)$ such that $D$…

Let $G$ be a graph with adjacency eigenvalues $\lambda_1 \geq \cdots \geq \lambda_n$. Both $\lambda_1 + \lambda_n$ and the odd girth of $G$ can be seen as measures of the bipartiteness of $G$. Csikv\'ari proved in 2022 that for odd girth 5…

Let $G$ be a simple, connected graph on $n$ vertices, and further assume that $G$ has disjoint cycles. Let $h$ be a real symmetric matrix supported on $G$ (for example, a discrete Schr\"odinger operator). The eigenvalues of $h$ are ordered…

We recall the construction of the Kontsevich graph orientation morphism $\gamma \mapsto {\rm O\vec{r}}(\gamma)$ which maps cocycles $\gamma$ in the non-oriented graph complex to infinitesimal symmetries $\dot{\mathcal{P}} = {\rm…