Linear and Multilinear Algebra ( IF 1.1 ) Pub Date : 2020-09-06 , DOI: 10.1080/03081087.2020.1814194 S. Pirzada 1 , H. A. Ganie 2 , A. Alhevaz 3 , M. Baghipur 4
ABSTRACT
For a simple connected graph G, let , , and , respectively, are the distance matrix, the diagonal matrix of the vertex transmissions, distance Laplacian matrix and the distance signless Laplacian matrix. The generalized distance matrix of G is the convex linear combinations of and and is defined as , for . As and , this matrix reduces to merging the distance spectral and distance signless Laplacian spectral theories. Let be the eigenvalues of and let be the generalized distance spectral spread of the graph G. In this paper, we obtain bounds for the generalized distance spectral spread . We also obtain a relation between the generalized distance spectral spread and the distance spectral spread . Further, we obtain lower bounds for of bipartite graphs involving different graph parameters and we characterize the extremal graphs for some cases. We also obtain lower bounds for in terms of clique number and independence number of the graph G and characterize the extremal graphs for some cases.
中文翻译:
关于图的广义距离矩阵的谱扩展
摘要
对于一个简单的连通图G,让,,和,分别是距离矩阵、顶点传输的对角矩阵、距离拉普拉斯矩阵和距离无符号拉普拉斯矩阵。广义距离矩阵G的凸线性组合和并定义为, 为了. 作为和,该矩阵简化为合并距离谱和距离无符号拉普拉斯谱理论。让是的特征值然后让是图G的广义距离谱扩展。在本文中,我们获得了广义距离谱扩展的界限. 我们还获得了广义距离谱扩展之间的关系和距离谱扩展. 此外,我们获得了下界涉及不同图参数的二部图,我们描述了某些情况下的极值图。我们还获得了下界在图G的团数和独立数方面,并在某些情况下刻画极值图。