Topics
virusAnimal
We determine the graphs with maximal spectral radius among the ones on n nodes with diameter D
Let $G_{n,\gamma}$ be the set of all connected graphs on $n$ vertices with domination number $\gamma...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractThe spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency ...
The spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency matrix) ...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AMS classifications: 05C50, 05E99;graphs;spectral radius;diameter;bound;degree/diameter
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix A(G)...
We determine a lower bound for the spectral radius of a graph in terms of the number of vertices and...
AbstractIn this paper we determine the graphs which have the minimal spectral radius (i.e., the larg...
AbstractWe determine a lower bound for the spectral radius of a graph in terms of the number of vert...
AbstractWe study graphs with spectral radius at most 322 and refine results by Woo and Neumaier [R. ...
AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distanc...
We study graphswith spectral radius atmost 3/2√2 and refine results byWoo and Neumaier [R.Woo, A. Ne...
AbstractIn the paper, we will determine graphs with the maximal spectral radius among all the unicyc...
We determine the graphs with maximal spectral radius among the ones on n nodes with diameter D
Let $G_{n,\gamma}$ be the set of all connected graphs on $n$ vertices with domination number $\gamma...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractThe spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency ...
The spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency matrix) ...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AMS classifications: 05C50, 05E99;graphs;spectral radius;diameter;bound;degree/diameter
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix A(G)...
We determine a lower bound for the spectral radius of a graph in terms of the number of vertices and...
AbstractIn this paper we determine the graphs which have the minimal spectral radius (i.e., the larg...
AbstractWe determine a lower bound for the spectral radius of a graph in terms of the number of vert...
AbstractWe study graphs with spectral radius at most 322 and refine results by Woo and Neumaier [R. ...
AbstractFor a connected graph, the distance spectral radius is the largest eigenvalue of its distanc...
We study graphswith spectral radius atmost 3/2√2 and refine results byWoo and Neumaier [R.Woo, A. Ne...
AbstractIn the paper, we will determine graphs with the maximal spectral radius among all the unicyc...
We determine the graphs with maximal spectral radius among the ones on n nodes with diameter D
Let $G_{n,\gamma}$ be the set of all connected graphs on $n$ vertices with domination number $\gamma...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
Add to ORKG