检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:WU Chun-jie
机构地区:[1]School of Minsheng College,Henan University,Kaifeng 475004,China
出 处:《Chinese Quarterly Journal of Mathematics》2020年第4期401-409,共9页数学季刊(英文版)
摘 要:For a simple connected graph G, let A(G) and Q(G) be the adjacency matrix and signless Laplacian matrix, respectively of G. The principal eigenvector of A(G)(resp.Q(G)) is the unit positive eigenvector corresponding to the largest eigenvalue of A(G)(resp. Q(G)). In this paper, an upper bound and lower bound for the sum of the squares of the entries of the principal eigenvector of Q(G) corresponding to the vertices of an independent set are obtained.
关 键 词:Signless Laplacian Principal eigenvector Independent set k-Regular Semiregular
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.40