Related papers: A sharp upper bound on the spectral gap for graphe…
In this paper, we characterize all graphs with eigenvectors of the signless Laplacian and adjacency matrices with components equal to $\{- 1, 0, 1\}.$ We extend the graph parameter max $k$-cut to square matrices and prove a general sharp…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…
In this paper, we study a singular perturbation of a problem used in dimension two to model graphene or in dimension three to describe the quark confinement phenomenon in hadrons. The operators we consider are of the form $H + M\beta V…
Assume that the compact Riemannian spin manifold $(M^n,g)$ admits a $G$-structure with characteristic connection $\nabla$ and parallel characteristic torsion ($\nabla T=0$), and consider the Dirac operator $D^{1/3}$ corresponding to the…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
This paper is devoted to the study of the conformal spectrum (and more precisely the first eigenvalue) of the Laplace-Beltrami operator on a smooth connected compact Riemannian surface without boundary, endowed with a conformal class. We…
In this paper, we study the higher Steklov eigenvalues of graphs on surfaces. We obtain the upper bound of higher Steklov eigenvalues of a finite graph $G$ with boundary $B$ and genus $g$ by using metrical deformation via probability flows.…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
There is evidence for existence of massless Dirac quasi-particles in graphene, which satisfy Dirac equation in (1+2) dimensions near the so called Dirac points which lie at the corners at the graphene's brilluoin zone. We revisit the…
This work investigates upper bounds for the spectrum of the Steklov-type operator on Riemannian manifolds with boundary. We extend the Fraser-Schoen estimate for the first positive Steklov eigenvalue to higher Steklov eigenvalues, in terms…
We analyze the limit of the spectrum of a geometric Dirac-type operator under a collapse with bounded diameter and bounded sectional curvature. In the case of a smooth limit space B, we show that the limit of the spectrum is given by the…
In this paper, we obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral…
We consider the low-energy electronic properties of graphene cones in the presence of a global Fries-Kekul\'e Peierls distortion. Such cones occur in fullerenes as the geometric response to the disclination associated with pentagon rings.…
We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.
We prove that the optimal constant in the Lieb--Thirring inequality on a star graph with $N$ edges coincides with that on $\mathbb R$ if $N$ is even. For odd $N$ we show that this property holds when restricting to radial potentials and we…
In this work we study theoretically the electronic properties of a sheet of graphene grown on a periodic heterostructure substrate. We write an effective Dirac equation, which includes a dependence of both the band gap and the Fermi…
Sharp bounds on the least eigenvalue of an arbitrary graph are presented. Necessary and sufficient (just sufficient) conditions for the lower (upper) bound to be attained are deduced using edge clique partitions. As an application, we prove…
In two previous papers, we started a study of the first eigenvalue of the Dirac operator on compact spin symmetric spaces, providing, for symmetric spaces of "inner" type, a formula giving this first eigenvalue in terms of the algebraic…
Inspired by the Li--Yau eigenvalue-diameter estimates, we investigate lower bounds for the first Dirichlet eigenvalue in terms of the diameter (or inscribed radius) of a graph. Let $G = (V, E)$ be a graph with boundary $B$. Assume that the…