A k-cyclic graph is a connected graph of order n and size n + k-1. In this paper, we determine the maximal signless Laplacian spectral radius and the corresponding extremal graph among all C_4-free k-cyclic graphs of ...A k-cyclic graph is a connected graph of order n and size n + k-1. In this paper, we determine the maximal signless Laplacian spectral radius and the corresponding extremal graph among all C_4-free k-cyclic graphs of order n. Furthermore, we determine the first three unicycles and bicyclic, C_4-free graphs whose spectral radius of the signless Laplacian is maximal. Similar results are obtained for the(combinatorial)展开更多
Some sharp upper bounds of Laplacian spectral radius of trees in terms of order,diameter,pendant vertex number,covering number,edge covering number or total independence number are given.And the ninth to thirteenth la...Some sharp upper bounds of Laplacian spectral radius of trees in terms of order,diameter,pendant vertex number,covering number,edge covering number or total independence number are given.And the ninth to thirteenth largest values of Laplacian spectral radius over the class of trees on a given order are also given.展开更多
Let S(m,d,k)be the set of k-uniform supertrees with m edges and diameter d,and S1(m,d,k)be the k-uniform supertree obtained from a loose path u_(1),e_(1),u_(2),e_(2),...,u_(d),e_(d),u_(d+1),with length d by attaching ...Let S(m,d,k)be the set of k-uniform supertrees with m edges and diameter d,and S1(m,d,k)be the k-uniform supertree obtained from a loose path u_(1),e_(1),u_(2),e_(2),...,u_(d),e_(d),u_(d+1),with length d by attaching m-d edges at vertex u_[d/2]+1.In this paper,we mainly determine S1(m,d,k)with the largest signless Laplacian spectral radius in S(m,d,k)for 3≤d≤m-1.We also determine the supertree with the second largest signless Laplacian spectral radius in S(m,3,k).Furthermore,we determine the unique/c-uniform supertree with the largest signless Laplacian spectral radius among all fc-uniform supertrees with n vertices and pendent edges(vertices).展开更多
In this paper, sharp upper bounds for the Laplacian spectral radius and the spectral radius of graphs are given, respectively. We show that some known bounds can be obtained from our bounds. For a bipartite graph G, w...In this paper, sharp upper bounds for the Laplacian spectral radius and the spectral radius of graphs are given, respectively. We show that some known bounds can be obtained from our bounds. For a bipartite graph G, we also present sharp lower bounds for the Laplacian spectral radius and the spectral radius, respectively.展开更多
Let T（n,i） be the set of all trees with order n and matching number i.We determine the third to sixth trees in T（2i ＋ 1,i） and the third to fifth trees in T（n,i） for n ≥ 2i ＋ 2 with the largest Laplacian spec...Let T（n,i） be the set of all trees with order n and matching number i.We determine the third to sixth trees in T（2i ＋ 1,i） and the third to fifth trees in T（n,i） for n ≥ 2i ＋ 2 with the largest Laplacian spectral radius.展开更多
Let G be a simple connected graph with order n.Let L(G)and Q(G)be the normalized Laplacian and normalized signless Laplacian matrices of G,respectively.Letλk(G)be the k-th smallest normalized Laplacian eigenvalue of ...Let G be a simple connected graph with order n.Let L(G)and Q(G)be the normalized Laplacian and normalized signless Laplacian matrices of G,respectively.Letλk(G)be the k-th smallest normalized Laplacian eigenvalue of G.Denote byρ(A)the spectral radius of the matrix A.In this paper,we study the behaviors ofλ2(G)andρ(L(G))when the graph is perturbed by three operations.We also study the properties ofρ(L(G))and X for the connected bipartite graphs,where X is a unit eigenvector of L(G)corresponding toρ(L(G)).Meanwhile we characterize all the simple connected graphs withρ(L(G))=ρ(Q(G)).展开更多
基金Supported by the National Natural Science Foundation of China（11171273） Supported by the Seed Foundation of Innovation and Creation for Graduate Students in Northwestern Polytechnical Uni- versity（Z2016170）
文摘A k-cyclic graph is a connected graph of order n and size n + k-1. In this paper, we determine the maximal signless Laplacian spectral radius and the corresponding extremal graph among all C_4-free k-cyclic graphs of order n. Furthermore, we determine the first three unicycles and bicyclic, C_4-free graphs whose spectral radius of the signless Laplacian is maximal. Similar results are obtained for the(combinatorial)
基金Supported by National Natural Science Foundation of China（10871204）
文摘Some sharp upper bounds of Laplacian spectral radius of trees in terms of order,diameter,pendant vertex number,covering number,edge covering number or total independence number are given.And the ninth to thirteenth largest values of Laplacian spectral radius over the class of trees on a given order are also given.
基金supported in part by the National Natural Science Foundation of China(Grant No.11871398)the Natural Science Foundation of Shaanxi Province(Nos.2020JQ-107,2020JQ-696)the Seed Foundation of Innovation and Creation for Graduate Students in Northwestern Polytechnical University(Nos.ZZ2018171,CX2020190).
文摘Let S(m,d,k)be the set of k-uniform supertrees with m edges and diameter d,and S1(m,d,k)be the k-uniform supertree obtained from a loose path u_(1),e_(1),u_(2),e_(2),...,u_(d),e_(d),u_(d+1),with length d by attaching m-d edges at vertex u_[d/2]+1.In this paper,we mainly determine S1(m,d,k)with the largest signless Laplacian spectral radius in S(m,d,k)for 3≤d≤m-1.We also determine the supertree with the second largest signless Laplacian spectral radius in S(m,3,k).Furthermore,we determine the unique/c-uniform supertree with the largest signless Laplacian spectral radius among all fc-uniform supertrees with n vertices and pendent edges(vertices).
文摘In this paper, sharp upper bounds for the Laplacian spectral radius and the spectral radius of graphs are given, respectively. We show that some known bounds can be obtained from our bounds. For a bipartite graph G, we also present sharp lower bounds for the Laplacian spectral radius and the spectral radius, respectively.
基金Supported by the National Natural Science Foundation of China (Grant No.10871204)
文摘Let T（n,i） be the set of all trees with order n and matching number i.We determine the third to sixth trees in T（2i ＋ 1,i） and the third to fifth trees in T（n,i） for n ≥ 2i ＋ 2 with the largest Laplacian spectral radius.
基金by the National Natural Science Foundation of China(No.11871398)the Natural Science Basic Research Plan in Shaanxi Province of China(Program No.2018JM1032)the Fundamental Research Funds for the Central Universities(No.3102019ghjd003).
文摘Let G be a simple connected graph with order n.Let L(G)and Q(G)be the normalized Laplacian and normalized signless Laplacian matrices of G,respectively.Letλk(G)be the k-th smallest normalized Laplacian eigenvalue of G.Denote byρ(A)the spectral radius of the matrix A.In this paper,we study the behaviors ofλ2(G)andρ(L(G))when the graph is perturbed by three operations.We also study the properties ofρ(L(G))and X for the connected bipartite graphs,where X is a unit eigenvector of L(G)corresponding toρ(L(G)).Meanwhile we characterize all the simple connected graphs withρ(L(G))=ρ(Q(G)).
