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
The spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency matrix) ...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
AMS classsifications: 05C50; 05E99; 94C15;graphs;spectral radius;diameter;networks;virus propagation
AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distanc...
AbstractIn this paper, we determine the unique graph with minimum distance spectral radius among all...
AbstractThe distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance mat...
AbstractIn the paper, we will determine graphs with the maximal spectral radius among all the unicyc...
AbstractA cactus is a connected graph in which any two cycles have at most one common vertex. In thi...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AbstractBicyclic graphs are connected graphs in which the number of edges equals the number of verti...
AbstractLet D(G⃗) denote the distance matrix of a strongly connected digraph G⃗. The largest eigenva...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
AbstractThe D-eigenvalues {μ1,μ2,…,…,μp} of a graph G are the eigenvalues of its distance matrix D a...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix A(G)...
The spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency matrix) ...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
AMS classsifications: 05C50; 05E99; 94C15;graphs;spectral radius;diameter;networks;virus propagation
AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distanc...
AbstractIn this paper, we determine the unique graph with minimum distance spectral radius among all...
AbstractThe distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance mat...
AbstractIn the paper, we will determine graphs with the maximal spectral radius among all the unicyc...
AbstractA cactus is a connected graph in which any two cycles have at most one common vertex. In thi...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AbstractBicyclic graphs are connected graphs in which the number of edges equals the number of verti...
AbstractLet D(G⃗) denote the distance matrix of a strongly connected digraph G⃗. The largest eigenva...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
AbstractThe D-eigenvalues {μ1,μ2,…,…,μp} of a graph G are the eigenvalues of its distance matrix D a...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix A(G)...
The spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency matrix) ...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
AMS classsifications: 05C50; 05E99; 94C15;graphs;spectral radius;diameter;networks;virus propagation
DOI
Add to ORKG