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 t...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.展开更多
Let G be a simple graph of order n and ρα(G) be the Aα(G)-spectral radius of G.In this note,for any vertex viof G,we establish the relationship between ρα(G) and ρα(G-vi).
For 0≤α<1,theα-spectral radius of an r-uniform hypergraph G is the spectral radius of A_(α)(G)=αD(G)+(1-α)A(G),where D(G)and A(G)are the diagonal tensor of degrees and adjacency tensor of G,respectively.In th...For 0≤α<1,theα-spectral radius of an r-uniform hypergraph G is the spectral radius of A_(α)(G)=αD(G)+(1-α)A(G),where D(G)and A(G)are the diagonal tensor of degrees and adjacency tensor of G,respectively.In this paper,we show the perturbation ofα-spectral radius by contracting an edge.Then we determine the unique unicyclic hypergraph with the maximumα-spectral radius among all r-uniform unicyclic hypergraphs with fixed diameter.We also determine the unique unicyclic hypergraph with the maximumα-spectral radius among all r-uniform unicyclic hypergraphs with given number of pendant edges.展开更多
文摘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.
基金Supported by the National Natural Science Foundation of China(Grant No.12171089)the Natural Science Foundation of Fujian Province(Grant No.2021J02048).
文摘Let G be a simple graph of order n and ρα(G) be the Aα(G)-spectral radius of G.In this note,for any vertex viof G,we establish the relationship between ρα(G) and ρα(G-vi).
基金Supported by the National Nature Science Foundation of China(Grant Nos.11871329,11971298)。
文摘For 0≤α<1,theα-spectral radius of an r-uniform hypergraph G is the spectral radius of A_(α)(G)=αD(G)+(1-α)A(G),where D(G)and A(G)are the diagonal tensor of degrees and adjacency tensor of G,respectively.In this paper,we show the perturbation ofα-spectral radius by contracting an edge.Then we determine the unique unicyclic hypergraph with the maximumα-spectral radius among all r-uniform unicyclic hypergraphs with fixed diameter.We also determine the unique unicyclic hypergraph with the maximumα-spectral radius among all r-uniform unicyclic hypergraphs with given number of pendant edges.
