相关论文: On the first and second eigenvalue of finite and i…

Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).

This is the first in a series of six articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. Many of…

We consider the signless $p$-Laplacian of a graph, a generalisation of the usual signless Laplacian (the case $p=2$). We show a Perron-Frobenius property and basic inequalites for the largest eigenvalue and provide upper and lower bounds…

In this paper, we derive an upper bound for higher order eigenvalues of the normalized Laplace operator associated with a symmetric finite graph in terms of lower order eigenvalues.

Eigenvalues of a graph are the eigenvalues of the corresponding (0,1)-adjacency matrix. The second largest eigenvalue lambda_2 provides significant information on characteristics and structure of graphs. Therefore, finding bounds for…

This is the sixth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

We prove the following Alon-Boppana type theorem for general (not necessarily regular) weighted graphs: if $G$ is an $n$-node weighted undirected graph of average combinatorial degree $d$ (that is, $G$ has $dn/2$ edges) and girth $g>…

We prove new lower and upper bounds on the higher gonalities of finite graphs. These bounds are generalizations of known upper and lower bounds for first gonality to higher gonalities, including upper bounds on gonality involving…

The Alon-Boppana theorem confirms that for every $\epsilon>0$ and every integer $d\ge3$, there are only finitely many $d$-regular graphs whose second largest eigenvalue is at most $2\sqrt{d-1}-\epsilon$. Serre gave a strengthening showing…

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…

We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero…

One of the best-known results in spectral graph theory is the inequality of Hoffman \[ \chi\left( G\right) \geq1-\frac{\lambda\left( G\right) }{\lambda_{\min }\left( G\right) }, \] where $\chi\left( G\right) $ is the chromatic number of a…

We derive bounds on the size of an independent set based on eigenvalues. This generalizes a result due to Delsarte and Hoffman. We use this to obtain new bounds on the independence number of the Erd\H{o}s-R\'{e}nyi graphs. We investigate…

In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest…

A two-coloring of the vertices $V$ of the hypergraph $H=(V, E)$ by red and blue has discrepancy $d$ if $d$ is the largest difference between the number of red and blue points in any edge. Let $f(n)$ be the fewest number of edges in an…

A celebrated result of Alon from 1993 states that any $d$-regular graph on $n$ vertices (where $d=O(n^{1/9})$) has a bisection with at most $\frac{dn}{2}(\frac{1}{2}-\Omega(\frac{1}{\sqrt{d}}))$ edges, and this is optimal. Recently, this…

We give upper bounds on the order of the automorphism group of a simple graph

We consider the spectral structure of indefinite second order boundary-value problems on graphs. A variational formulation for such boundary-value problems on graphs is given and we obtain both full and half-range completeness results. This…

Let $G$ be a connected undirected graph with $n$, $n\ge 3$, vertices and $m$ edges. Denote by $\rho_1 \ge \rho_2 \ge \cdots > \rho_n =0$ the normalized Laplacian eigenvalues of $G$. Upper and lower bounds of $\rho_i$, $i=1,2,\ldots , n-1$,…

We prove sharp upper bounds for the first and second non-trivial eigenvalues of the Neumann Laplacian in two classes of domains: parallelograms and domains of constant width. This gives in particular a new proof of an isoperimetric…