AbstractVarious conditions on the eigenvalues and eigenvectors of a graph are found to be sufficient for its reconstructibility. In particular, a graph is reconstructible if all but at most one of its eigenvalues are simple and have eigenvectors not orthogonal to c, where c is the vector with each entry equal to one
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...
The interplay between spectrum and structure of graphs is the recurring theme of the three more or l...
AbstractVarious conditions on the eigenvalues and eigenvectors of a graph are found to be sufficient...
AbstractThe following theorem is proved: If there exists a subgraph Gj of G none of whose eigenvecto...
AbstractThis paper is concerned with the spectral version of the reconstruction conjecture: Whether ...
A spectral inverse problem concerns the reconstruction of parameters of a parent graph from prescrib...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
AbstractWe extend the traditional spectral invariants (spectrum and angles) by a stronger polynomial...
[[abstract]]Graph transformations which preserve the multiplicity of the eigenvalue zero in the spec...
AbstractGraph transformations which preserve the multiplicity of the eigenvalue zero in the spectrum...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
In recent years, many network perturbation techniques, such as topological perturbations and service...
A spectral inverse problem concerns the reconstruction of parameters of a parent graph from prescrib...
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...
The interplay between spectrum and structure of graphs is the recurring theme of the three more or l...
AbstractVarious conditions on the eigenvalues and eigenvectors of a graph are found to be sufficient...
AbstractThe following theorem is proved: If there exists a subgraph Gj of G none of whose eigenvecto...
AbstractThis paper is concerned with the spectral version of the reconstruction conjecture: Whether ...
A spectral inverse problem concerns the reconstruction of parameters of a parent graph from prescrib...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
AbstractWe extend the traditional spectral invariants (spectrum and angles) by a stronger polynomial...
[[abstract]]Graph transformations which preserve the multiplicity of the eigenvalue zero in the spec...
AbstractGraph transformations which preserve the multiplicity of the eigenvalue zero in the spectrum...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
In recent years, many network perturbation techniques, such as topological perturbations and service...
A spectral inverse problem concerns the reconstruction of parameters of a parent graph from prescrib...
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...
The interplay between spectrum and structure of graphs is the recurring theme of the three more or l...
DOI
Add to ORKG