典型文献
Deleting Vertices and Interlacing of Aα Eigenvalues of a Graph
文献摘要：
Let G be simple graph with vertex set V and edge set E.In this paper,we establish an interlacing inequality between the Aα eigenvalues of G and its subgraph G-U,where U C V.Moreover,as an application,this interlacing property can be used to deduce some Aα spectral conditions concerning the independence number,cover number,Hamiltonian property and spanning tree of a graph,respectively.
文献关键词：
中图分类号：
作者姓名：
Hongzhang CHEN;Jianxi LI
作者机构：
School of Mathematics and Statistics,Minnan Normal University,Fujian 363000,P.R.China
文献出处：
引用格式：
[1]Hongzhang CHEN;Jianxi LI-.Deleting Vertices and Interlacing of Aα Eigenvalues of a Graph)[J].数学研究及应用,2022(05):455-462
A类：
Deleting,Vertices,Interlacing,Eigenvalues
B类：
Graph,Let,simple,vertex,set,edge,this,paper,establish,interlacing,inequality,between,eigenvalues,its,subgraph,where,Moreover,as,application,property,can,used,deduce,some,spectral,conditions,concerning,independence,number,cover,Hamiltonian,spanning,tree,respectively
AB值：
0.591761
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
