AbstractIn this paper, we determine the unique graph with minimum distance spectral radius among all connected bipartite graphs of order n with a given matching number. Moreover, we characterize the graphs with minimal distance spectral radius in the class of all connected bipartite graphs with a given vertex connectivity
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
AbstractIn this paper, we determine the unique graph with minimum distance spectral radius among all...
AbstractLet Gnr be the class of all connected graphs of order n with r pendent vertices. In this pap...
AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distanc...
AbstractLet GB(n,d) be the set of bipartite graphs with order n and diameter d. This paper character...
Let k, p, q be positive integers with k < p < q+1. We prove that the maximum spectral radius of a si...
The graphs with smallest, respectively largest, distance spectral radius among the connected graphs,...
In this paper we study three families of graphs, one is the graphs of order <i>n</i> with connectivi...
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractIn this paper, we study the largest Laplacian spectral radius of the bipartite graphs with n...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the unicyclic ...
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. ...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
AbstractIn this paper, we determine the unique graph with minimum distance spectral radius among all...
AbstractLet Gnr be the class of all connected graphs of order n with r pendent vertices. In this pap...
AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distanc...
AbstractLet GB(n,d) be the set of bipartite graphs with order n and diameter d. This paper character...
Let k, p, q be positive integers with k < p < q+1. We prove that the maximum spectral radius of a si...
The graphs with smallest, respectively largest, distance spectral radius among the connected graphs,...
In this paper we study three families of graphs, one is the graphs of order <i>n</i> with connectivi...
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractIn this paper, we study the largest Laplacian spectral radius of the bipartite graphs with n...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the unicyclic ...
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. ...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
DOI
Add to ORKG