AbstractIn the paper, we will determine graphs with the maximal spectral radius among all the unicyclic graphs with n vertices and diameter d
AbstractIn this paper, we give some results on Laplacian spectral radius of graphs with cut vertices...
AMS classifications: 05C50, 05E99;graphs;spectral radius;diameter;bound;degree/diameter
AbstractWe study graphs with spectral radius at most 322 and refine results by Woo and Neumaier [R. ...
AbstractBicyclic graphs are connected graphs in which the number of edges equals the number of verti...
AbstractLet U+(2k) be the set of all unicyclic graphs on 2k(k⩾2) vertices with perfect matchings. Le...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AbstractIn the paper, we identify graphs with the maximal signless Laplacian spectral radius among a...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
G = (V (G),E(G)) be a unicyclic simple undirected graph with largest vertex degree . Let Cr be the...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distanc...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the unicyclic ...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractLet B(n,g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we deter...
AbstractIn this paper, we give some results on Laplacian spectral radius of graphs with cut vertices...
AMS classifications: 05C50, 05E99;graphs;spectral radius;diameter;bound;degree/diameter
AbstractWe study graphs with spectral radius at most 322 and refine results by Woo and Neumaier [R. ...
AbstractBicyclic graphs are connected graphs in which the number of edges equals the number of verti...
AbstractLet U+(2k) be the set of all unicyclic graphs on 2k(k⩾2) vertices with perfect matchings. Le...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AbstractIn the paper, we identify graphs with the maximal signless Laplacian spectral radius among a...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
G = (V (G),E(G)) be a unicyclic simple undirected graph with largest vertex degree . Let Cr be the...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distanc...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the unicyclic ...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractLet B(n,g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we deter...
AbstractIn this paper, we give some results on Laplacian spectral radius of graphs with cut vertices...
AMS classifications: 05C50, 05E99;graphs;spectral radius;diameter;bound;degree/diameter
AbstractWe study graphs with spectral radius at most 322 and refine results by Woo and Neumaier [R. ...
DOI
Add to ORKG