English
Related papers

Related papers: A family of diameter-based eigenvalue bounds for q…

200 papers

For a graph with largest normalized Laplacian eigenvalue $\lambda_N$ and (vertex) coloring number $\chi$, it is known that $\lambda_N\geq \chi/(\chi-1)$. Here we prove properties of graphs for which this bound is sharp, and we study the…

Combinatorics · Mathematics 2024-07-08 Lies Beers , Raffaella Mulas

In his survey "Beyond graph energy: Norms of graphs and matrices" (2016), Nikiforov proposed two problems concerning characterizing the graphs that attain equality in a lower bound and in a upper bound for the energy of a graph,…

Combinatorics · Mathematics 2020-10-06 N. E. Arévalo , R. O. Braga , V. M. Rodrigues

An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian…

Combinatorics · Mathematics 2015-06-18 Nathan Reff

Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…

Spectral Theory · Mathematics 2025-12-02 Mats-Erik Pistol

This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…

Combinatorics · Mathematics 2018-08-28 A. Abiad , G. Coutinho , M. A. Fiol

This paper gives a tight upper bound on the spectral radius of the signless Laplacian of graphs of given order and clique number. More precisely, let G be a graph of order n, let A be its adjacency matrix, and let D be the diagonal matrix…

Combinatorics · Mathematics 2013-09-20 Nair Maria Maia de Abreu , Vladimir Nikiforov

We prove interlacing inequalities between spectral minimal energies of metric graphs built on Dirichlet and standard Laplacian eigenvalues, as recently introduced in [Kennedy et al, arXiv:2005.01126]. These inequalities, which involve the…

Spectral Theory · Mathematics 2021-07-28 Matthias Hofmann , James B. Kennedy

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…

Combinatorics · Mathematics 2024-12-19 Alan Lew

We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide…

Spectral Theory · Mathematics 2019-09-18 Pavel Kurasov , Jonathan Rohleder

Consider a semigraph $G=(V,\,E)$; in this paper, we study the eigenvalues of the Laplacian matrix of $G$. We show that the Laplacian of $G$ is positive semi-definite, and $G$ is connected if and only if $\lambda_2 >0.$ Along the similar…

Combinatorics · Mathematics 2023-07-10 Pralhad M. Shinde

We develop a Logvinenko--Sereda theory for one-dimensional vector-valued self-adjoint operators. We thus deliver upper bounds on $L^2$-norms of eigenfunctions -- and linear combinations thereof -- in terms of their $L^2$- and…

Spectral Theory · Mathematics 2024-07-23 Michela Egidi , Delio Mugnolo , Albrecht Seelmann

A discrete analog of quantum unique ergodicity was proved for Cayley graphs of quasirandom groups by Magee, Thomas and Zhao. They show that for large graphs there exist real orthonormal basis of eigenfunctions of the adjacency matrix such…

Mathematical Physics · Physics 2024-12-24 Jon Harrison , Clare Pruss

It is a well-known fact that a graph of diameter $d$ has at least $d+1$ eigenvalues. Let us call a graph \emph{$d$-extremal} if it has diameter $d$ and exactly $d+1$ eigenvalues. Such graphs have been intensively studied by various authors.…

Combinatorics · Mathematics 2014-05-15 Felix Goldberg , Steve Kirkland , Anu Varghese , Ambat Vijayakumar

We establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $\nu_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schr\"odinger operators…

Spectral Theory · Mathematics 2021-11-03 Matthias Hofmann , James B. Kennedy , Delio Mugnolo , Marvin Plümer

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

Quantum Algebra · Mathematics 2019-07-01 Christian Eder , Viktor Levandovskyy , Julien Schanz , Simon Schmidt , Andreas Steenpass , Moritz Weber

Let $G$ be a connected graph on $n$ vertices with diameter $d$. It is known that if $2\le d\le n-2$, there are at most $n-d$ Laplacian eigenvalues in the interval $[n-d+2, n]$. In this paper, we show that if $1\le d\le n-3$, there are at…

Combinatorics · Mathematics 2023-06-27 Leyou Xu , Bo Zhou

Let $(M,g)$ be a compact $n$-dimensional Riemannian manifold with nonempty boundary and $n\geq 2$. Assume that ${\mathrm{Ric}(M)\ge (n-1)K}$ for some ${K>0}$ and that $\partial M$ has nonnegative mean curvature with respect to the outward…

Differential Geometry · Mathematics 2025-12-29 Thomas Schürmann

We introduce higher-order Poincar'e constants for compact weighted manifolds and estimate them from above in terms of subsets. These estimates imply upper bounds for eigenvalues of the weighted Laplacian and the first nontrivial eigenvalue…

Differential Geometry · Mathematics 2019-11-18 Kei Funano , Yohei Sakurai

We study the volume growth of metric balls as a function of the radius in discrete spaces, and focus on the relationship between volume growth and discrete curvature. We improve volume growth bounds under a lower bound on the so-called…

Combinatorics · Mathematics 2019-10-15 Brian Benson , Peter Ralli , Prasad Tetali

An amply regular graph is a regular graph such that any two adjacent vertices have $\alpha$ common neighbors and any two vertices with distance $2$ have $\beta$ common neighbors. We prove a sharp lower bound estimate for the Lin--Lu--Yau…

Combinatorics · Mathematics 2024-06-12 Xueping Huang , Shiping Liu , Qing Xia
‹ Prev 1 8 9 10 Next ›