In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues of the so-called adjacency matrix of a given graph. Because of that, we present the basic concepts and some basic results from linear algebra and a short introduction to a graph theory. We introduce the concepts of adjacency matrices, eigenvalues and the spectrum of a given graph. We investigate how the properties of a given graph reflect on its spectrum. For the well-known families of graphs we calculated their spectra
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
A graph can be represented by an adjacency matrix, with an entry of 1 at position i, j if the i^th n...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
To study dynamical systems, graphs are often used to capture the interactions among their components...
Spectral graph theory is an important interdisciplinary field of science and mathematics in which me...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
The study of eigenvalues and eigenvectors of various matrices associated with graph
Given a graph we can associate several matrices which record information about vertices and how they...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
These notes are not necessarily an accurate representation of what happened in class. The notes writ...
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 ...
The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and...
Let G be a graph with n vertices, 1 (G) n (G) be the eigenvalues of its adjacency matrix, ...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
A graph can be represented by an adjacency matrix, with an entry of 1 at position i, j if the i^th n...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
To study dynamical systems, graphs are often used to capture the interactions among their components...
Spectral graph theory is an important interdisciplinary field of science and mathematics in which me...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
The study of eigenvalues and eigenvectors of various matrices associated with graph
Given a graph we can associate several matrices which record information about vertices and how they...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
These notes are not necessarily an accurate representation of what happened in class. The notes writ...
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 ...
The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and...
Let G be a graph with n vertices, 1 (G) n (G) be the eigenvalues of its adjacency matrix, ...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
A graph can be represented by an adjacency matrix, with an entry of 1 at position i, j if the i^th n...