AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, we determine the unique graph with minimum distance spectral radius among all connected graphs of order n with a given diameter. Moreover, we determine the unique graph with maximum distance spectral radius among the catacondensed hexagonal systems with h hexagons
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distanc...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
AbstractIn this paper, we determine the unique graph with minimum distance spectral radius among all...
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...
AbstractLet Gnr be the class of all connected graphs of order n with r pendent vertices. In this pap...
AbstractThe distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance mat...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
The graphs with smallest, respectively largest, distance spectral radius among the connected graphs,...
AbstractThe D-eigenvalues {μ1,μ2,…,…,μp} of a graph G are the eigenvalues of its distance matrix D a...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
Let G be a connected graph with vertex set V (G) and edge set E(G). The distance matrix of G is defi...
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distanc...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
AbstractIn this paper, we determine the unique graph with minimum distance spectral radius among all...
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...
AbstractLet Gnr be the class of all connected graphs of order n with r pendent vertices. In this pap...
AbstractThe distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance mat...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
The graphs with smallest, respectively largest, distance spectral radius among the connected graphs,...
AbstractThe D-eigenvalues {μ1,μ2,…,…,μp} of a graph G are the eigenvalues of its distance matrix D a...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
Let G be a connected graph with vertex set V (G) and edge set E(G). The distance matrix of G is defi...
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
DOI
Add to ORKG