AbstractLet Gnr be the class of all connected graphs of order n with r pendent vertices. In this paper, we determine the unique graph with minimal distance spectral radius in Gnr. In addition, we determine the unique graph with maximal distance spectral radius in Gnr for each r∈{2,3,n-3,n-2,n-1}
In this paper we study three families of graphs, one is the graphs of order <i>n</i> with connectivi...
AbstractLet GB(n,d) be the set of bipartite graphs with order n and diameter d. This paper character...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the unicyclic ...
AbstractIn this paper, we determine the unique graph with minimum distance spectral radius among all...
AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distanc...
The graphs with smallest, respectively largest, distance spectral radius among the connected graphs,...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the tricyclic ...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
AbstractThe distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance mat...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
AbstractLet D(G⃗) denote the distance matrix of a strongly connected digraph G⃗. The largest eigenva...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractA cactus is a connected graph in which any two cycles have at most one common vertex. In thi...
AbstractWe study the spectral radius of graphs with n vertices and k cut edges. In this paper, we sh...
In this paper we study three families of graphs, one is the graphs of order <i>n</i> with connectivi...
AbstractLet GB(n,d) be the set of bipartite graphs with order n and diameter d. This paper character...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the unicyclic ...
AbstractIn this paper, we determine the unique graph with minimum distance spectral radius among all...
AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distanc...
The graphs with smallest, respectively largest, distance spectral radius among the connected graphs,...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the tricyclic ...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
AbstractThe distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance mat...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
AbstractLet D(G⃗) denote the distance matrix of a strongly connected digraph G⃗. The largest eigenva...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractA cactus is a connected graph in which any two cycles have at most one common vertex. In thi...
AbstractWe study the spectral radius of graphs with n vertices and k cut edges. In this paper, we sh...
In this paper we study three families of graphs, one is the graphs of order <i>n</i> with connectivi...
AbstractLet GB(n,d) be the set of bipartite graphs with order n and diameter d. This paper character...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the unicyclic ...
DOI
Add to ORKG