DOIAbstract
AbstractWe compute the eigenvalues of the complete multipartite graph and present some applications of our result
AbstractWe compute the eigenvalues of the complete multipartite graph and present some applications of our result
To study dynamical systems, graphs are often used to capture the interactions among their components...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
Suppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest eigenvalue...
The spectrum S(G) of a graph G is defined as the sequence of eigenvalues of its adjacency matrix. Th...
AbstractWe compute the eigenvalues of the complete multipartite graph and present some applications ...
The Seidel energy of a simple graph G is the sum of the absolute values of the eigenvalues of the Se...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
Let G be a simple and undirected graph. The eigenvalues of the adjacency matrix of G are called the ...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
The complete graph is often used to verify certain graph theoretical definitions and applications. R...
For a simple, undirected graph G(n), let lambda(i)(G(n)) be the ith largest eigenvalue of G(n). This...
AbstractSuppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest ei...
Let G be a graph with n vertices, 1 (G) n (G) be the eigenvalues of its adjacency matrix, ...
To study dynamical systems, graphs are often used to capture the interactions among their components...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
Suppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest eigenvalue...
The spectrum S(G) of a graph G is defined as the sequence of eigenvalues of its adjacency matrix. Th...
AbstractWe compute the eigenvalues of the complete multipartite graph and present some applications ...
The Seidel energy of a simple graph G is the sum of the absolute values of the eigenvalues of the Se...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
Let G be a simple and undirected graph. The eigenvalues of the adjacency matrix of G are called the ...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
The complete graph is often used to verify certain graph theoretical definitions and applications. R...
For a simple, undirected graph G(n), let lambda(i)(G(n)) be the ith largest eigenvalue of G(n). This...
AbstractSuppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest ei...
Let G be a graph with n vertices, 1 (G) n (G) be the eigenvalues of its adjacency matrix, ...
To study dynamical systems, graphs are often used to capture the interactions among their components...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
Suppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest eigenvalue...
Add to ORKG