A well-known result of Nosal states that a graph $G$ with $m$ edges and $λ(G) > \sqrt{m}$ contains a triangle. Nikiforov [Combin. Probab. Comput. 11 (2002)] extended this result to cliques by showing that if $λ(G) > \sqrt{2m(1-1/r)}$, then $G$ contains a copy of $K_{r+1}$. Let $C_k^+$ be the graph obtained from a cycle $C_k$ by adding an edge to two vertices with distance two, and let $F_k$ be the friendship graph consisting of $k$ triangles that share a common vertex. Recently, Zhai, Lin and Shu [European J. Combin. 95 (2021)], Sun, Li and Wei [Discrete Math. 346 (2023)], and Li, Lu and Peng [Discrete Math. 346 (2023)] proved that if $ m\ge 8$ and $λ(G) \ge \frac{1}{2} (1+\sqrt{4m-3})$, then $G$ contains a copy of $C_5,C_5^+$ and $F_2$, respectively, unless $G=K_2\vee \frac{m-1}{2}K_1$. In this paper, we give a unified extension by showing that such a graph contains a copy of $V_5$, where $V_5=K_1\vee P_4$ is the join of a vertex and a path on four vertices. Our result extends the aforementioned results since $C_5,C_5^+$ and $F_2$ are proper subgraphs of $V_5$. In addition, we prove that if $m\ge 33$ and $λ(G) \ge 1+ \sqrt{m-2}$, then $G$ contains a copy of $F_3$, unless $G=K_3\vee \frac{m-3}{3}K_1$. This confirms a conjecture on the friendship graph $F_k$ in the case $k=3$. Finally, we conclude some spectral extremal graph problems concerning the large fan graphs and wheel graphs.
On the Ky Fan $k$-norm of the $LI$-matrix of graphs
设$A(G)$和$D(G)$分别是图$G$的邻接矩阵和度对角矩阵。则$L(G)=D(G)-A(G)$称为图$G$的拉普拉斯矩阵。设$G$是一个具有$n$顶点和$m$边的图.然后将$G$的$LI$ -矩阵定义为$LI(G)=L(G)-\frac{2m}{n}I_n$,其中$I_n$是单位矩阵。本文研究了图的$LI$ -矩阵的Ky Fan $k$ -范数的极值性质,它与谱图理论中的一些著名问题和结果密切相关,如Laplacian谱半径、Laplacian扩展、$k$最大Laplacian特征值之和、Laplacian能量等.给出了图的$LI$ -矩阵的Ky Fan $k$ -范数的一些界,并对极图进行了部分刻画.此外,还确定了树、单圈图和双圈图的$LI$ -矩阵的Ky Fan $k$ -范数的上、下界,并刻画了相应的极图.
近年来,图的迹范数在图能量的名义下得到了广泛的研究。在本文中,一些研究扩展到更一般的矩阵范数,如Schatten p-范数和Ky Fan k-范数。只要有可能的结果都给图和一般矩阵。在不同的背景下观察到一个令人困惑的事实:当1<=p =2时,Schatten p-范数有很大的不同<2 and for p>。
Spectral extremal results for triangle-free graphs with chromatic number at least four
School of Mathematics, East China University of Science and Technology(华东理工大学数学学院);School of Mathematics and Physics, Xinjiang Institute of Engineering(新疆工程学院数理学院)
Turán extremal graphs vs. Signless Laplacian spectral Turán extremal graphs
School of Mathematics and Statistics, Hainan University(海南大学数学与统计学院);Department of Mathematics, Shanghai Normal University(上海师范大学数学系);School of Mathematical Sciences, MOE-LSC, SHL-MAC, Shanghai Jiao Tong University(上海交通大学数学科学学院)
A general theorem in spectral extremal graph theory
University of Delaware, Department of Mathematical Sciences(特拉华大学);University of Wyoming, Department of Mathematics and Statistics(怀俄明大学);The University of Memphis, Department of Mathematical Sciences(孟菲斯大学);Villanova University, Department of Mathematics & Statistics(维拉诺瓦大学)
Spectral extremal problems for fractional $ID$-$[a,b]$-factor-critical graphs
School of Mathematics and Statistics, Northwestern Polytechnical University(西北工业大学数学与统计学院);Xi’an-Budapest Joint Research Center for Combinatorics, Northwestern Polytechnical University(西北工业大学西安-布达佩斯组合学联合研究中心);College of Science, Northwest A&F University(西北农林科技大学理学院)
Spectral extremal graphs without intersecting triangles as a minor
令$F_s$是通过共享公共顶点而从$s$三角形获得的友谊图。对于固定的$s\ge 2$和足够大的$n$,达到最大谱半径的$n$阶的无$F_s$图首先由Cioabelo,Feng,Tait和Zhang [Electron. J. Combin. 27(4)(2020)],后来由Zhai,Liu和Xue [Electron. J. Combin. 29(3)(2022)]。近年来,不含$H$的图的谱极值问题得到了广泛的研究。例如,Tait [J. Combin. Theory Ser. A 166(2019)],Zhai and Lin [J. Combin.理论系列B 157(2022)]分别解决了$H=K_r$和$H=K_{s,t}$的情况。受这些结果的启发,我们考虑了$H=F_s$情形下的谱极值问题。证明了$K_s \vee I_{n-s}$是所有$n$ -顶点$F_s$ -无子图中唯一的达到最大谱半径的图.此外,令$Q_t$是通过共享公共顶点从长度为$4$的圈的$t$副本获得的图。我们还确定了唯一的$Q_t$ -minor-free图达到最大的谱半径。即,$K_t \vee M_{n-t}$,其中$M_{n-t}$是通过嵌入由$\lfloor \frac{n-t}{2}\rfloor$边组成的匹配从阶$n-t$的独立集合获得的图。
Some results on the distance spectral radius and edge-disjoint spanning trees of graphs
School of Mathematics and Statistics, Northwestern Polytechnical University(西北工业大学数学与统计学院);Xi’an-Budapest Joint Research Center for Combinatorics, Northwestern Polytechnical University(西北工业大学西安-布达佩斯组合学联合研究中心)
Turán-type extremal problems for unbalanced signed graphs
Northwestern Polytechnical University(西北工业大学);Xi’an-Budapest Joint Research Center for Combinatorics, Northwestern Polytechnical University(西安-布达佩斯组合学联合研究中心);School of Mathematical Sciences & Academy for Multidisciplinary Studies, Captial Normal University(首都师范大学数学科学学院与跨学科研究院)