AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents an algebraically defined invariant system of a graph. We get some bounds of the eigenvalues of graphs and propose a few open problems
AbstractLet G be a simple graph of order n with t triangle(s). Also let λ1(G),λ2(G),…,λn(G) be the e...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
These notes are not necessarily an accurate representation of what happened in class. The notes writ...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractIn this paper we improve some classical bounds on the greatest eigenvalue of the adjuacency ...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bo...
AbstractLet G be a simple graph of order n with t triangle(s). Also let λ1(G),λ2(G),…,λn(G) be the e...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
These notes are not necessarily an accurate representation of what happened in class. The notes writ...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractIn this paper we improve some classical bounds on the greatest eigenvalue of the adjuacency ...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bo...
AbstractLet G be a simple graph of order n with t triangle(s). Also let λ1(G),λ2(G),…,λn(G) be the e...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
These notes are not necessarily an accurate representation of what happened in class. The notes writ...
DOI
Add to ORKG