Add to ORKGThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. An eigenvalue of a graph is called main if the corresponding eigenspace contains a vector for which the sum of coordinates is different from 0. Connected graphs in which all eigenvalues are mutually distinct and main have recently attracted attention in control theory
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
Connected graphs whose eigenvalues are distinct and main are called controllable graphs in view of c...
A universal adjacency matrix U of a graph G is a linear combination of the 0–1 adjacency matrix A, t...
A universal adjacency matrix U of a graph G is a linear combination of the 0–1 adjacency matrix A, t...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
Given a graph we can associate several matrices which record information about vertices and how they...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
An eigenvalue of the adjacency matrix of a graph is said to be main if the all-1 vector is non-ortho...
www.elsevier.com/locate/aml An eigenvalue of a graph G is called a main eigenvalue if it has an eige...
To study dynamical systems, graphs are often used to capture the interactions among their components...
AbstractAn eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of w...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
Connected graphs whose eigenvalues are distinct and main are called controllable graphs in view of c...
A universal adjacency matrix U of a graph G is a linear combination of the 0–1 adjacency matrix A, t...
A universal adjacency matrix U of a graph G is a linear combination of the 0–1 adjacency matrix A, t...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
Given a graph we can associate several matrices which record information about vertices and how they...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
An eigenvalue of the adjacency matrix of a graph is said to be main if the all-1 vector is non-ortho...
www.elsevier.com/locate/aml An eigenvalue of a graph G is called a main eigenvalue if it has an eige...
To study dynamical systems, graphs are often used to capture the interactions among their components...
AbstractAn eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of w...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...