Bounds for the largest and the smallest A(alpha) eigenvalues of a graph in terms of vertex degrees

首页> 外文期刊>Linear Algebra and its Applications >Bounds for the largest and the smallest A(alpha) eigenvalues of a graph in terms of vertex degrees

【24h】

Bounds for the largest and the smallest A(alpha) eigenvalues of a graph in terms of vertex degrees

机译：在顶点度数方面的最大和最小A（alpha）特征值的界限

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Let G be a graph with adjacency matrix A(G) and with D(G) the diagonal matrix of its vertex degrees. Nikiforov defined the matrix A alpha(G), with alpha is an element of [0,1], as

机译：设G是具有邻接矩阵A（g）的图，并且具有d（g）其顶点度的对角线矩阵。 Nikiforov定义了矩阵Aα（g），alpha是[0,1]的元素，如

著录项

来源
《Linear Algebra and its Applications》 |2020年第2020期|共14页
作者

展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类线性代数;
关键词
A(alpha)-spectrum of graphs; Spectral radius; The smallest eigenvalue;

机译：A（alpha） - 谱图;光谱半径;最小的特征值;

相似文献

外文文献
中文文献
专利

1. Bounds for the largest and the smallest A(alpha) eigenvalues of a graph in terms of vertex degrees [J] . Linear Algebra and its Applications . 2020,第期

机译：在顶点度数方面的最大和最小A（alpha）特征值的界限
2. Bounding the largest eigenvalue of trees in terms of the largest vertex degree [J] . Stevanovic D. Linear Algebra and its Applications . 2003,第0期

机译：以最大顶点度为界限制树的最大特征值
3. Bipartite graphs with bounded vertex degree and largest eigenvalue of the form root r [J] . Ilic Aleksandar Applied mathematics and computation . 2018,第期

机译：具有界界顶点的二分和形式根r的最大特征值
4. The lower bound of the second largest Laplacian eigenvalue on unicyclic graph [C] . Ying Liu, Shuangcheng Wang 2011 international conference on economic and information management . 2011

机译：单环图上第二大Laplacian特征值的下界
5. Bounding the Maximal Character Degree in Terms of Smaller Degrees in the Symmetric Groups [D] . Soomro, Sadaf Komal. 2018

机译：在对称组中的较小度方面界定最大性状程度
6. On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree [O] . Shu-Guang Guo, Rong Zhang -1

机译：具有最大固定度的非二分连通图的最小无符号Laplacian特征值
7. Bounding the largest eigenvalue of trees in terms of the largest vertex degree [O] . Stevanović Dragan 2003

机译：以最大顶点度为界限制树的最大特征值

Bounds for the largest and the smallest A(alpha) eigenvalues of a graph in terms of vertex degrees

摘要

著录项

相似文献

相关主题

期刊订阅