AbstractTricyclic graphs are connected graphs in which the number of edges equals the number of vertices plus two. In this paper, we determine the graph with the largest Laplacian spectral radius among all tricyclic graphs with n vertices and k pendant vertices
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractBicyclic graphs are connected graphs in which the number of edges equals the number of verti...
AbstractIn this paper, we consider the following problem: of all tricyclic graphs or trees of order ...
AbstractTricyclic graphs are connected graphs in which the number of edges equals the number of vert...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
AbstractIn this paper, we consider the following problem: of all tricyclic graphs or trees of order ...
AbstractA connected graph of order n is bicyclic if it has n+1 edges. He et al. [C.X. He, J.Y. Shao,...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the tricyclic ...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
AbstractIn this paper, we give some results on Laplacian spectral radius of graphs with cut vertices...
AbstractA graph G of order n is called a bicyclic graph if G is connected and the number of edges of...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractBicyclic graphs are connected graphs in which the number of edges equals the number of verti...
AbstractIn this paper, we consider the following problem: of all tricyclic graphs or trees of order ...
AbstractTricyclic graphs are connected graphs in which the number of edges equals the number of vert...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
AbstractIn this paper, we consider the following problem: of all tricyclic graphs or trees of order ...
AbstractA connected graph of order n is bicyclic if it has n+1 edges. He et al. [C.X. He, J.Y. Shao,...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the tricyclic ...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
AbstractIn this paper, we give some results on Laplacian spectral radius of graphs with cut vertices...
AbstractA graph G of order n is called a bicyclic graph if G is connected and the number of edges of...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractBicyclic graphs are connected graphs in which the number of edges equals the number of verti...
DOI
Add to ORKG