AbstractLet B(n,g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we determine the unique graph with the maximal spectral radius among all graphs in B(n,g). Moreover, the maximal spectral radius is a decreasing function on g
AbstractIn this paper, we determine graphs with the largest spectral radius among all the unicyclic ...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractLet ℬ(n,g) be the class of bicyclic graphs on n vertices with girth g. Let ℬ1(n,g) be the su...
AbstractBicyclic graphs are connected graphs in which the number of edges equals the number of verti...
AbstractLet GB(n,d) be the set of bipartite graphs with order n and diameter d. This paper character...
AbstractA bicyclic graph is a connected graph in which the number of edges equals the number of vert...
AbstractA graph G of order n is called a bicyclic graph if G is connected and the number of edges of...
A b s t r a c t. Let K3 and K ′3 be two complete graphs of order 3 with disjoint vertex sets. Let B∗...
AbstractA connected graph of order n is bicyclic if it has n+1 edges. He et al. [C.X. He, J.Y. Shao,...
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractIn the paper, we will determine graphs with the maximal spectral radius among all the unicyc...
AbstractLet B(n,d) be the set of bipartite graphs with order n and diameter d. The extremal graph Gd...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the unicyclic ...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractLet ℬ(n,g) be the class of bicyclic graphs on n vertices with girth g. Let ℬ1(n,g) be the su...
AbstractBicyclic graphs are connected graphs in which the number of edges equals the number of verti...
AbstractLet GB(n,d) be the set of bipartite graphs with order n and diameter d. This paper character...
AbstractA bicyclic graph is a connected graph in which the number of edges equals the number of vert...
AbstractA graph G of order n is called a bicyclic graph if G is connected and the number of edges of...
A b s t r a c t. Let K3 and K ′3 be two complete graphs of order 3 with disjoint vertex sets. Let B∗...
AbstractA connected graph of order n is bicyclic if it has n+1 edges. He et al. [C.X. He, J.Y. Shao,...
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractIn the paper, we will determine graphs with the maximal spectral radius among all the unicyc...
AbstractLet B(n,d) be the set of bipartite graphs with order n and diameter d. The extremal graph Gd...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the unicyclic ...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
DOI
Add to ORKG