Let $α'$ and $μ_i$ denote the matching number of a non-empty simple graph $G$ with $n$ vertices and the $i$-th smallest eigenvalue of its Laplacian matrix, respectively. In this paper, we prove a tight lower bound $$α' \ge \min\left\{\Big\lceil\frac{μ_2}{μ_n} (n -1)\Big\rceil,\ \ \Big\lceil\frac{1}{2}(n-1)\Big\rceil \right\}.$$ This bound strengthens the result of Brouwer and Haemers who proved that if $n$ is even and $2μ_2 \ge μ_n$, then $G$ has a perfect matching. A graph $G$ is factor-critical if for every vertex $v\in V(G)$, $G-v$ has a perfect matching. We also prove an analogue to the result of Brouwer and Haemers mentioned above by showing that if $n$ is odd and $2μ_2 \ge μ_n$, then $G$ is factor-critical. We use the separation inequality of Haemers to get a useful lemma, which is the key idea in the proofs. This lemma is of its own interest and has other applications. In particular, we prove similar results for the number of balloons, spanning even subgraphs, as well as spanning trees with bounded degree.
We conjecture that the sum of the square roots of the Laplacian eigenvalues of a graph does not exceed the sum of the square roots of its signless Laplacian eigenvalues.
A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, we first give the necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues, and then characterize the trees and unicyclic graphs with exactly two main signless Laplacian eigenvalues, respectively.
A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected bicyclic graphs with exactly two main eigenvalues are determined.
Let $G$ be a simple graph and $α$ a real number. The quantity $s_α(G)$ defined as the sum of the $α$-th power of the non-zero Laplacian eigenvalues of $G$ generalizes several concepts in the literature. The Laplacian Estrada index is a newly introduced graph invariant based on Laplacian eigenvalues. We establish bounds for $s_α$ and Laplacian Estrada index related to the degree sequences.
In this paper, we characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues of which one is equal to $1$, determine all connected bipartite graphs with at least one vertex of degree $1$ having exactly four distinct normalized Laplacian eigenvalues, and find all unicyclic graphs with three or four distinct normalized Laplacian eigenvalues.
In this paper, we obtain the bounds of the extreme eigenvalues of a normalized and signless Laplacian matrices using by their traces. In addition, we determine the bounds for k-th eigenvalues of normalized and signless Laplacian matrices.
In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues. In addition, we present a sufficient condition for the existence of Hamiltonicity in a graph involving its Laplacian eigenvalues.
In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than $1$ are simple and also the multiplicity of Laplacian eigenvalue $1$ has been well studied before. Here we consider the multiplicities of the other (non-integral) Laplacian eigenvalues. We give an upper bound and determine the trees of order $n$ that have a multiplicity that is close to the upper bound $\frac{n-3}{2}$, and emphasize the particular role of the algebraic connectivity.
We show that the number of Laplacian eigenvalues greater than the average degree of a tree having $n$ vertices is at most $\lfloor\frac{n}{2} \rfloor$.
Let $G$ be a connected simple graph with $n$ vertices. The distance Laplacian matrix $D^{L}(G)$ is defined as $D^L(G)=Diag(Tr)-D(G)$, where $Diag(Tr)$ is the diagonal matrix of vertex transmissions and $D(G)$ is the distance matrix of $G$. The eigenvalues of $D^{L}(G)$ are the distance Laplacian eigenvalues of $G$ and are denoted by $\partial_{1}^{L}(G)\geq \partial_{2}^{L}(G)\geq \dots \geq \partial_{n}^{L}(G)$. The largest eigenvalue $\partial_{1}^{L}(G)$ is called the distance Laplacian spectral radius. Lu et al. (2017), Fernandes et al. (2018) and Ma et al. (2018) completely characterized …
Let $G$ be a connected $m$-uniform hypergraph. In this paper we mainly consider the eigenvectors of the Laplacian or signless Laplacian tensor of $G$ associated with zero eigenvalue, called the first Laplacian or signless Laplacian eigenvectors of $G$. By means of the incidence matrix of $G$, the number of first Laplacian or signless Laplaican (H- or N-)eigenvectors can be get explicitly by solving the Smith normal form of the incidence matrix over $\mathbb{Z}_m$ or $\mathbb{Z}_2$. Consequently, we prove that the number of first Laplacian (H-)eigenvectors is equal to the number of first signle…
In this paper we show a monotonicity theorem for the harmonic eigenfunction of λ_{1} of the normalized Laplacian over the points of articulation of a graph. We introduce the definition of Perron component for the normalized Laplacian matrix of a graph and show how its second smallest eigenvalue can be characterized using this definition.
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless Laplacian matrix. These bounds improve and extend previously known bounds.
Let $G$ be a connected simple graph on $n$ vertices. Let $\mathcal{L}(G)$ be the normalized Laplacian matrix of $G$ and $ρ_{n-1}(G)$ be the second least eigenvalue of $\mathcal{L}(G)$. Denote by $ν(G)$ the independence number of $G$. Recently, the paper [Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity $n-3$, arXiv:1912.13227] discussed the graphs with some normalized Laplacian eigenvalue of multiplicity $n-3$. However, there is one remaining case (graphs with $ρ_{n-1}(G)\neq 1$ and $ν(G)= 2$) not considered. In this paper, we focus on cographs and graphs wi…
Let $T$ be a tree on $n$ vertices with $q$-Laplacian $L_{T}^{q}$. Let $GTS_n$ be the generalized tree shift poset on the set of unlabelled trees with $n$ vertices. We prove that for all $q \in R$, going up on $GTS_n$ has the following effect: the spectral radius and the second smallest eigenvalue of $L_{T}^{q}$ increase while the smallest eigenvalue of $L_{T}^{q}$ decreases. These generalize known results for eigenvalues of the Laplacian. As a corollary, we obtain consequences about the eigenvalues of $q,t$-Laplacians and exponential distance matrices of trees.
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 for the smallest eigenvalue in terms of a parameter related to the bipartiteness. The latter result generalises bounds by Desai and Rao and, interestingly, in the limit $p\to 1$ upper and lower bounds coincide.
In this paper we determine the graph whose least eigenvalue of signless Laplacian attains the minimum or maximum among all connected non-bipartite graphs of fixed order and given number of pendant vertices. Thus we obtain a lower bound and an upper bound for the least eigenvalue of signless Laplacian of a graph in terms of the number of pendent vertices.
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 $λ_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest Laplacian eigenvalue of $G$ respectively. Then $ λ_{m+1}(G)\leq d_{m}(G)+m-1 $ for $\bar{G} \neq K_{m}+(n-m)K_1 $. We also introduce upper and lower bound for the Laplacian eigenvalues of weighted graphs, and compare it with the special case of unweighted graphs.
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues. Strongly regular graphs and complete bipartite graphs are examples of such graphs, but we also construct more exotic families of examples from conference graphs, projective planes, and certain quasi-symmetric designs.
Graphs with few distinct eigenvalues have been investigated extensively. In this paper, we focus on another relevant topic: characterizing graphs with some eigenvalue of large multiplicity. Specifically, the normalized Laplacian matrix of a graph is considered here. Let $ρ_{n-1}(G)$ and $ν(G)$ be the second least normalized Laplacian eigenvalue and the independence number of a graph $G$, respectively. As the main conclusions, two families of $n$-vertex connected graphs with some normalized Laplacian eigenvalue of multiplicity $n-3$ are determined: graphs with $ρ_{n-1}(G)=-1$ and graphs with $ρ…
Let $G$ be a connected simple graph of order $n$. Let $ρ_1(G)\geq ρ_2(G)\geq \cdots \geq ρ_{n-1}(G)> ρ_n(G)=0$ be the eigenvalues of the normalized Laplacian matrix $\mathcal{L}(G)$ of $G$. Denote by $m(ρ_i)$ the multiplicity of the normalized Laplacian eigenvalue $ρ_i$. Let $ν(G)$ be the independence number of $G$. In this paper, we give a full characterization of graphs with some normalized Laplacian eigenvalue of multiplicity $n-3$, which answers a remaining problem in [S. Sun, K.C. Das, On the multiplicities of normalized Laplacian eigenvalues of graphs, Linear Algebra Appl. 609 (2021) 365…
Let $G$ be a connected non-bipartite graph on $n$ vertices with domination number $γ\le \frac{n+1}{3}$. We investigate the least eigenvalue of the signless Laplacian of $G$, and present a lower bound for such eigenvalue in terms of the domination number $γ$.
The toughness $t(G)$ of a graph $G=(V,E)$ is defined as $t(G)=\min\{\frac{|S|}{c(G-S)}\}$, in which the minimum is taken over all $S\subset V$ such that $G-S$ is disconnected, where $c(G-S)$ denotes the number of components of $G-S$. We present two tight lower bounds for $t(G)$ in terms of the Laplacian eigenvalues and provide strong support for a conjecture for a better bound which, if true, implies both bounds, and improves and generalizes known bounds by Alon, Brouwer, and the first author. As applications, several new results on perfect matchings, factors and walks from Laplacian eigenvalu…
Motivated by classic tree algorithms, in 1995 we designed a bottom-up $O(n)$ algorithm to compute the determinant of a tree's adjacency matrix $A$. In 2010 an $O(n)$ algorithm was found for constructing a diagonal matrix congruent to $A + xI_n$, $x \in \mathbb{R}$, enabling one to easily count the number of eigenvalues in any interval. A variation of the algorithm allows Laplacian eigenvalues in trees to be counted. We conjecture that for any tree $T$ of order $n \geq 2$, at least half of its Laplacian eigenvalues are less than $\bar{d} = 2 - \frac{2}{n}$, its average vertex degree.
Let $G$ be a simple graph and $Q(G)$ be the signless Laplacian matrix of $G$. Let $S_α(G)$ be the sum of the $α$-th powers of the nonzero eigenvalues of $Q(G)$. We disprove two conjectures by You and Yang on the extremal values of $S_α(G)$ among bipartite graphs and among graphs with bounded connectivity.
Let $G$ be a simple connected graph with order $n$. Let $\mathcal{L}(G)$ be the normalized Laplacian matrix of $G$. Let $λ_{k}(G)$ be the $k$-th smallest normalized Laplacian eigenvalue of $G$. Denote $ρ(A)$ the spectral radius of the matrix $A$. In this paper, we study the behaviors of $λ_{2}(G)$ and $ρ(\mathcal{L}(G))$ when the graph is perturbed by three operations.
We provide upper and lower bounds on the smallest eigenvalue of grounded Laplacian matrices (which are matrices obtained by removing certain rows and columns of the Laplacian matrix of a given graph). The gap between the upper and lower bounds depends on the ratio of the smallest and largest components of the eigenvector corresponding to the smallest eigenvalue of the grounded Laplacian. We provide a graph-theoretic bound on this ratio, and subsequently obtain a tight characterization of the smallest eigenvalue for certain classes of graphs. Specifically, for Erdos-Renyi random graphs, we show…
We show how the spectrum of a graph Laplacian changes with respect to a certain type of rank-one perturbation. We apply our finding to give new short proofs of the spectral version of Kirchhoff's Matrix Tree Theorem and known derivations for the characteristic polynomials of the Laplacians for several well known families of graphs, including complete, complete multipartite, and threshold graphs.
We consider $Γ=(X,E)$ a dual polar graph and we give a tight frame on each eigenspace of the Laplacian operator associated to $Γ$. We compute the constants associated to each tight frame and as an application we give a formula for the product in the Norton algebra attached to the eigenspace corresponding to the second largest eigenvalue of the Laplacian.
In this paper, we establish the relation between classic invariants of graphs and their integer Laplacian eigenvalues, focusing on a subclass of chordal graphs, the strictly chordal graphs, and pointing out how their computation can be efficiently implemented. Firstly we review results concerning general graphs showing that the number of universal vertices and the degree of false and true twins provide integer Laplacian eigenvalues and their multiplicities. Afterwards, we prove that many integer Laplacian eigenvalues of a strictly chordal graph are directly related to particular simplicial ver…
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Laplacian eigenvalues of graphs, and characterize equality. This leads to generalizations of, and variations on theorems by Grone, and Grone and Merris. As a consequence we obtain inequalities involving bounds for some well-known parameters of a graph, such as edge-connectivity, and the isoperimetric number.
Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed with triangles share a common vertex have been addressed. Further using the number and degrees of common neighbors between vertices some new upper bounds for the largest eigenvalue have been introduced.
In this paper, structural properties of chordal graphs are analysed, in order to establish a relationship between these structures and integer Laplacian eigenvalues. We present the characterization of chordal graphs with equal vertex and algebraic connectivities, by means of the vertices that compose the minimal vertex separators of the graph; we stablish a sufficient condition for the cardinality of a maximal clique to appear as an integer Laplacian eigenvalue. Finally, we review two subclasses of chordal graphs, showing for them some new properties.
We derive upper bounds for the eigenvalues of the Kirchhoff Laplacian on a compact metric graph depending on the graph's genus g. These bounds can be further improved if $g = 0$, i.e. if the metric graph is planar. Our results are based on a spectral correspondence between the Kirchhoff Laplacian and a particular a certain combinatorial weighted Laplacian. In order to take advantage of this correspondence, we also prove new estimates for the eigenvalues of the weighted combinatorial Laplacians that were previously known only in the weighted case.
We prove that the diameter of any unweighted connected graph G is O(k log n/lambda_k), for any k>= 2. Here, lambda_k is the k smallest eigenvalue of the normalized laplacian of G. This solves a problem posed by Gil Kalai.
In this paper, we study eigenvalues and eigenfunctions of $p$-Laplacians with Dirichlet boundary condition on graphs. We characterize the first eigenfunction (and the maximum eigenfunction for a bipartite graph) via the sign condition. By the uniqueness of the first eigenfunction of $p$-Laplacian, as $p\to 1,$ we identify the Cheeger constant of a symmetric graph with that of the quotient graph. By this approach, we calculate various Cheeger constants of spherically symmetric graphs.
