AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the literature. Not nearly as much seems to be known about bounds on other eigenvalues of the spectrum. Several results are presented here toward that goal, first for the general class of simple graphs, then for triangle-free graphs and finally for the even more restricted class of bipartite graphs
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
Let λ (G) be the largest eigenvalue of the adjacency matrix of a graph G. We show that if G is Kp+1-...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
Let (G) and min (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. O...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
Let μ (G) and μmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G....
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
Let μ (G) and μmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G....
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
Let λ (G) be the largest eigenvalue of the adjacency matrix of a graph G. We show that if G is Kp+1-...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
Let (G) and min (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. O...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
Let μ (G) and μmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G....
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
Let μ (G) and μmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G....
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
Let λ (G) be the largest eigenvalue of the adjacency matrix of a graph G. We show that if G is Kp+1-...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
DOI
Add to ORKG