AbstractA decomposition result for planar graphs is used to prove that the spectral radius of a planar graph on n vertices is less than 4 + √ 3 (n − 3). Moreover, the spectral radius of an outerplanar graph on n vertices is less than 1 + √2 + √2 + √n − 5
Let μ(G) denote the spectral radius of a graph G. We partly confirm a conjecture due to Nikiforov, w...
Let t≥3 and G be a graph of order n, with no K2,t minor. If n\u3e400t6, then the spectral radius μ(G...
AbstractWe determine a lower bound for the spectral radius of a graph in terms of the number of vert...
AbstractA decomposition result for planar graphs is used to prove that the spectral radius of a plan...
AbstractIt is well known that the spectral radius of a tree whose maximum degree is Δ cannot exceed ...
AbstractWe complete the determination of the graphs in the title, begun by Cvetković, Doob, and Gutm...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
Abstract. We prove that the spectral gap of a finite planar graph X is bounded by λ1pXq ď C logpdiam...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
We determine a lower bound for the spectral radius of a graph in terms of the number of vertices and...
AbstractWe study the spectral radius of graphs with n vertices and k cut edges. In this paper, we sh...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spe...
AbstractWe give upper bounds for the spectral radius of a graph with e edges provided that there is ...
Let μ(G) denote the spectral radius of a graph G. We partly confirm a conjecture due to Nikiforov, w...
Let t≥3 and G be a graph of order n, with no K2,t minor. If n\u3e400t6, then the spectral radius μ(G...
AbstractWe determine a lower bound for the spectral radius of a graph in terms of the number of vert...
AbstractA decomposition result for planar graphs is used to prove that the spectral radius of a plan...
AbstractIt is well known that the spectral radius of a tree whose maximum degree is Δ cannot exceed ...
AbstractWe complete the determination of the graphs in the title, begun by Cvetković, Doob, and Gutm...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
Abstract. We prove that the spectral gap of a finite planar graph X is bounded by λ1pXq ď C logpdiam...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
We determine a lower bound for the spectral radius of a graph in terms of the number of vertices and...
AbstractWe study the spectral radius of graphs with n vertices and k cut edges. In this paper, we sh...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spe...
AbstractWe give upper bounds for the spectral radius of a graph with e edges provided that there is ...
Let μ(G) denote the spectral radius of a graph G. We partly confirm a conjecture due to Nikiforov, w...
Let t≥3 and G be a graph of order n, with no K2,t minor. If n\u3e400t6, then the spectral radius μ(G...
AbstractWe determine a lower bound for the spectral radius of a graph in terms of the number of vert...
DOI
Add to ORKG