AbstractLet ℬ(n,g) be the class of bicyclic graphs on n vertices with girth g. Let ℬ1(n,g) be the subclass of ℬ(n,g) consisting of all bicyclic graphs with two edge-disjoint cycles and ℬ2(n,g)=ℬ(n,g)∖ℬ1(n,g). This paper determines the unique graph with the maximal Laplacian spectral radius among all graphs in ℬ1(n,g) and ℬ2(n,g), respectively. Furthermore, the upper bound of the Laplacian spectral radius and the extremal graph for ℬ(n,g) are also obtained
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractA bicyclic graph is a connected graph in which the number of edges equals the number of vert...
AbstractIn this paper, we give some results on Laplacian spectral radius of graphs with cut vertices...
AbstractLet B(n,g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we deter...
AbstractA graph G of order n is called a bicyclic graph if G is connected and the number of edges of...
AbstractA connected graph of order n is bicyclic if it has n+1 edges. He et al. [C.X. He, J.Y. Shao,...
AbstractBicyclic graphs are connected graphs in which the number of edges equals the number of verti...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractLet B(n,d) be the set of bipartite graphs with order n and diameter d. The extremal graph Gd...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
AbstractIn this paper, we study the largest Laplacian spectral radius of the bipartite graphs with n...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractTricyclic graphs are connected graphs in which the number of edges equals the number of vert...
summary:In this paper we consider the following problem: Over the class of all simple connected unic...
Let C(n,k) be the set of all unicyclic graphs with n vertices and cycle length k. For any U∈C(n,k), ...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractA bicyclic graph is a connected graph in which the number of edges equals the number of vert...
AbstractIn this paper, we give some results on Laplacian spectral radius of graphs with cut vertices...
AbstractLet B(n,g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we deter...
AbstractA graph G of order n is called a bicyclic graph if G is connected and the number of edges of...
AbstractA connected graph of order n is bicyclic if it has n+1 edges. He et al. [C.X. He, J.Y. Shao,...
AbstractBicyclic graphs are connected graphs in which the number of edges equals the number of verti...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractLet B(n,d) be the set of bipartite graphs with order n and diameter d. The extremal graph Gd...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
AbstractIn this paper, we study the largest Laplacian spectral radius of the bipartite graphs with n...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractTricyclic graphs are connected graphs in which the number of edges equals the number of vert...
summary:In this paper we consider the following problem: Over the class of all simple connected unic...
Let C(n,k) be the set of all unicyclic graphs with n vertices and cycle length k. For any U∈C(n,k), ...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractA bicyclic graph is a connected graph in which the number of edges equals the number of vert...
AbstractIn this paper, we give some results on Laplacian spectral radius of graphs with cut vertices...