Let n ≥ 1, d = 2n, and let (x,y) ∈ ℝⁿ × ℝⁿ be a generic point in ℝ²ⁿ. The twisted Laplacian $L=-1/2{\sum }_{j=1}^n[({\partial }_{x_j}+i{y}_j)²+({\partial }_{y_j}-i{x}_j)²]$ has the spectrum n + 2k = λ²: k a nonnegative integer. Let $P_{\lambda }$ be the spectral projection onto the (infinite-dimensional) eigenspace. We find the optimal exponent ϱ(p) in the estimate $\left|\right|P_{\lambda }{u\left|\right|}_{L^p\left({ℝ}^d\right)}\lesssim {\lambda }^{\varrho \left(p\right)}{\left|\right|u\left|\right|}_{L²\left({ℝ}^d\right)}$ for all p ∈ [2,∞], improving previous partial results by Ratnakumar, Rawat and Thangavelu, and by Stempak and Zienkiewicz. The expression for ϱ(p) is ϱ(p) = 1/p -1/2 if 2 ≤ p ≤ 2(d+1)/(d-1), ϱ(p) = (d-2)/2 - d/p...

For a set $\{A,B,C,...\}$ of graphs, an $\{A,B,C,...\}$-factor of a graph $G$ is a spanning subgraph $F$ of $G$, where each component of $F$ is contained in $\{A,B,C,...\}$. It is very interesting to investigate the existence of factors in a graph with given minimum degree from the prospective of eigenvalues. We first propose a tight sufficient condition in terms of the $Q$-spectral radius for a graph involving minimum degree to contain a star factor. Moreover, we also present tight sufficient conditions based on the $Q$-spectral radius...

The imbalance of an edge $e=\{u,v\}$ in a graph is defined as $i\left(e\right)=\left|d\right(u)-d(v\left)\right|$, where $d(·)$ is the vertex degree. The irregularity $I\left(G\right)$ of $G$ is then defined as the sum of imbalances over all edges of $G$. This concept was introduced by Albertson who proved that $I\left(G\right)\le 4n^3/27$ (where $n=\left|V\right(G\left)\right|$) and obtained stronger bounds for bipartite and triangle-free graphs. Since then a number of additional bounds were given by various authors. In this paper we prove a new upper bound, which improves a bound found by Zhou and Luo in 2008. Our bound involves...

A signed graph $\Gamma$ is a graph whose edges are labeled by signs. If $\Gamma$ has $n$ vertices, its spectral radius is the number $\rho \left(\Gamma \right):=max\left\{\right|{\lambda }_i\left(\Gamma \right)|:1\le i\le n\}$, where ${\lambda }_1\left(\Gamma \right)\ge \cdots \ge {\lambda }_n\left(\Gamma \right)$ are the eigenvalues of the signed adjacency matrix $A\left(\Gamma \right)$. Here we determine the signed graphs achieving the minimal or the maximal spectral radius in the classes ${𝔘}_n$ and ${𝔅}_n$ of unbalanced unicyclic graphs and unbalanced bicyclic graphs, respectively.

For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues ${\rho }_1^L\ge {\rho }_2^L\ge \cdots \ge {\rho }_n^L$, the distance Laplacian energy $\mathrm{DLE}\left(G\right)$ is defined as $\mathrm{DLE}\left(G\right)={\sum }_{i=1}^n|{\rho }_i^L-2W\left(G\right)/n|$, where $W\left(G\right)$ is the Wiener index of $G$. We obtain a relationship between the Laplacian energy and the distance Laplacian energy for graphs with diameter 2. We obtain lower bounds for the distance Laplacian energy $\mathrm{DLE}\left(G\right)$ in terms of the order $n$, the Wiener index $W\left(G\right)$, the independence number, the vertex connectivity number and other given parameters. We characterize the...

Let ϕ: [0,1] → [0,1] be a nondecreasing continuous function such that ϕ(x) > x for all x ∈ (0,1). Let the operator $V_{\varphi }:f\left(x\right)\mapsto {\int }_0^{\varphi \left(x\right)}f\left(t\right)dt$ be defined on L₂[0,1]. We prove that $V_{\varphi }$ has a finite number of nonzero eigenvalues if and only if ϕ(0) > 0 and ϕ(1-ε) = 1 for some 0 < ε < 1. Also, we show that the spectral trace of the operator $V_{\varphi }$ always equals 1.

Let ${\mu }_{n-1}\left(G\right)$ be the algebraic connectivity, and let ${\mu }_1\left(G\right)$ be the Laplacian spectral radius of a $k$-connected graph $G$ with $n$ vertices and $m$ edges. In this paper, we prove that $${\mu }_{n-1}\left(G\right)\ge \frac{2n{k}^2}{(n(n-1)-2m)(n+k-2)+2k^2},$$ with equality if and only if $G$ is the complete graph $K_n$ or $K_n-e$. Moreover, if $G$ is non-regular, then $${\mu }_1\left(G\right)<2\Delta -\frac{2(n\Delta -2m)k^2}{2(n\Delta -2m)(n^2-2n+2k)+n{k}^2},$$ where $\Delta$ stands for the maximum degree of $G$. Remark that in some cases, these two inequalities improve some previously known results.

Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We firstly give a sharp bound for $m_G\left(\mu \right)$, the multiplicity of a Laplacian eigenvalue $\mu$ of $G$. As a straightforward result, $m_U\left(1\right)\le n-2$. We then provide two graph operations (i.e., grafting and shifting) on graph $G$ for which the value of $m_G\left(1\right)$ is nondecreasing. As applications, we get the distribution of $m_U\left(1\right)$ for unicyclic graphs on $n$ vertices. Moreover, for the two largest possible values of $m_U\left(1\right)\in \{n-5,n-3\}$, the corresponding graphs $U$ are...

Let $G=(V,E)$, $V=\{v_1,v_2,...,v_n\}$, be a simple connected graph with $n$ vertices, $m$ edges and a sequence of vertex degrees $d_1\ge d_2\ge \cdots \ge d_n$. Denote by $A$ and $D$ the adjacency matrix and diagonal vertex degree matrix of $G$, respectively. The signless Laplacian of $G$ is defined as $L^{+}=D+A$ and the normalized signless Laplacian matrix as ${ℒ}^{+}=D^{-1/2}{L}^{+}{D}^{-1/2}$. The normalized signless Laplacian spreads of a connected nonbipartite graph $G$ are defined as $r\left(G\right)={\gamma }_2^{+}/{\gamma }_n^{+}$ and $l\left(G\right)={\gamma }_2^{+}-{\gamma }_n^{+}$, where ${\gamma }_1^{+}\ge {\gamma }_2^{+}\ge \cdots \ge {\gamma }_n^{+}\ge 0$ are eigenvalues of ${ℒ}^{+}$. We establish sharp lower and upper bounds for the normalized signless...

Finding and discovering any class of graphs which are determined by their spectra is always an important and interesting problem in the spectral graph theory. The main aim of this study is to characterize two classes of multicone graphs which are determined by both their adjacency and Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let $K_w$ denote a complete graph on $w$ vertices, and let $m$ be a positive integer number. In A. Z. Abdian (2016)...