AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the graph that has the maximal spectral radius in this class. We also discuss the limit point of the maximal spectral radius
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
AbstractLet B(n,g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we deter...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
AbstractWe study the spectral radius of graphs with n vertices and k cut edges. In this paper, we sh...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
We study the spectral radius of graphs with n vertices and k cut edges. In this paper, we show that ...
AbstractIn this paper, we characterize the extremal graph having the maximal Laplacian spectral radi...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AbstractThe spectral radius of a (directed) graph is the largest eigenvalue of adjacency matrix of t...
AbstractWe give upper bounds for the spectral radius of a graph with e edges provided that there is ...
AbstractIn this paper, we show that among all the connected graphs with n vertices and k cut vertice...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
AbstractIn this paper we consider the following problem: Of all trees of order n with k pendant vert...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
AbstractLet B(n,g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we deter...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
AbstractWe study the spectral radius of graphs with n vertices and k cut edges. In this paper, we sh...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
We study the spectral radius of graphs with n vertices and k cut edges. In this paper, we show that ...
AbstractIn this paper, we characterize the extremal graph having the maximal Laplacian spectral radi...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AbstractThe spectral radius of a (directed) graph is the largest eigenvalue of adjacency matrix of t...
AbstractWe give upper bounds for the spectral radius of a graph with e edges provided that there is ...
AbstractIn this paper, we show that among all the connected graphs with n vertices and k cut vertice...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
AbstractIn this paper we consider the following problem: Of all trees of order n with k pendant vert...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
AbstractLet B(n,g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we deter...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
DOI
Add to ORKG