相关论文: The largest Laplacian eigenvalue and the balancedn…

As a nonlinear extension of the graph Laplacian, the graph $p$-Laplacian has various applications in many fields. Due to the nonlinearity, it is very difficult to compute the eigenvalues and eigenfunctions of graph $p$-Laplacian. In this…

Let G be a graph, H be its chromatic number, L be the largest eigenvalue of its Laplacian, and M be the largest eigenvalue of its adjacency matrix. Then, complementing a well-known result of Hoffman, we show that L>=(H/(H-1))M

The $k$-token graph $F_k(G)$ of a graph $G$ on $n$ vertices is the graph whose vertices are the ${n\choose k}$ $k$-subsets of vertices from $G$, two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices…

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…

Let X(G) denote the flag complex of a graph G=(V,E) on n vertices. We study relations between the first eigenvalues of successive higher Laplacians of X(G). One consequence is the following result: Let \lambda_2(G) denote the second…

We provide bounds for the sequence of eigenvalues $\{\lambda_i(\Omega)\}_i$ of the Dirichlet problem $$ L_\Delta u=\lambda u\ \ {\rm in}\ \, \Omega,\quad\quad u=0\ \ {\rm in}\ \ \mathbb{R}^N\setminus \Omega,$$ where $L_\Delta$ is the…

For some positive integer $k$, if the finite cyclic group $\mathbb{Z}_k$ can act freely on a graph $G$, then we say that $G$ is $k$-symmetric. In 1985, Faria showed that the multiplicity of Laplacian eigenvalue 1 is greater than or equal to…

Let $G=(V,E)$ be an $n$-vertex graph, $L(G)\in \mathbb{R}^{n\times n}$ its Laplacian matrix, and let $\lambda_1(L(G))\ge \lambda_2(L(G))\ge \cdots\ge \lambda_n(L(G))=0$ denote its eigenvalues. For $1\le k\le n$, let $\varepsilon_k(G)=…

We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.

Let $G$ be a connected graph and $Q(G)$ be the signless Laplacian of $G$. The principal ratio $\gamma(G)$ of $Q(G)$ is the ratio of the maximum and minimum entries of the Perron vector of $Q(G)$. In this paper, we consider the maximum…

We present a thorough study of the theoretical properties and devise efficient algorithms for the \emph{persistent Laplacian}, an extension of the standard combinatorial Laplacian to the setting of pairs (or, in more generality, sequences)…

In this paper, we study the spectrum of the weighted Laplacian (also called Bakry-Emery or Witten Laplacian) $L_\sigma$ on a compact, connected, smooth Riemannian manifold $(M,g)$ endowed with a measure $\sigma dv_g$. First, we obtain upper…

We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H$^+$-eigenvalues, i.e., H-eigenvalues with nonnegative H-eigenvectors, and H$^{++}$-eigenvalues, i.e.,…

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…

Let $G$ be a graph with $n$ vertices. We denote the largest signless Laplacian eigenvalue of $G$ by $q_1(G)$ and Laplacian eigenvalues of $G$ by $\mu_1(G)\ge\cdots\ge\mu_{n-1}(G)\ge\mu_n(G)=0$. It is a conjecture on Laplacian spread of…

The distance matrix $\mathcal{D}$ of a connected graph $G$ is the matrix indexed by the vertices of $G$ which entry $\mathcal{D}_{i,j}$ equals the distance between the vertices $v_i$ and $v_j$. The distance signless Laplacian matrix…

Let $\lambda_{1}(G)$ and $\mu_{1}(G)$ denote the spectral radius and the Laplacian spectral radius of a graph $G$, respectively. Li in [Electronic J. Linear Algebra 34 (2018) 389-392] proved sharp upper bounds of $\lambda_{1}(G)$ based on…

The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…

A signed graph $\Sigma=(G,\sigma)$ consists of an underlying graph $G=(V,E)$ with a sign function $\sigma:E\rightarrow\{-1,1\}$. Let $A(\Sigma)$ be the adjacency matrix of $\Sigma$ and $\lambda_1(\Sigma)$ denote the largest eigenvalue…

We study the degree of an $L$-Lipschitz map between Riemannian manifolds, proving new upper bounds and constructing new examples. For instance, if $X_k$ is the connected sum of $k$ copies of $\mathbb CP^2$ for $k \ge 4$, then we prove that…