DOIAbstract
AbstractThe following theorem is proved: If there exists a subgraph Gj of G none of whose eigenvectors is orthogonal to C, where C is the vector with each component equal to one, then G is reconstructible
AbstractThe following theorem is proved: If there exists a subgraph Gj of G none of whose eigenvectors is orthogonal to C, where C is the vector with each component equal to one, then G is reconstructible
A spectral inverse problem concerns the reconstruction of parameters of a parent graph from prescrib...
AbstractWe prove that a tree with at least three cutvertices is reconstructible from its cutvertex- ...
AbstractTutte proved that, if two graphs, both with more than two vertices, have the same collection...
AbstractVarious conditions on the eigenvalues and eigenvectors of a graph are found to be sufficient...
This doctoral thesis deals with the reconstruction conjecture in graph theory. This over 70 year old...
In this paper, we study the simple eigenvectors of two hypomorphic matrices using linear algebra. We...
Abstract. We give a bound on the reconstructibility of an action G X in terms of the reconstructibi...
A spectral inverse problem concerns the reconstruction of parameters of a parent graph from prescrib...
AbstractUsing only the set of point-deleted subgraphs, several invariants of a graph are derived. Th...
A graph polynomial P (G, x) is called reconstructible if it is uniquely determined by the polynomia...
AbstractIn this paper, we consider graphs whose deck consists of cards (which are the vertex-deleted...
A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of...
In this paper we show that specific classes of graphs are reconstructible; we explore the relationsh...
AbstractWe prove the following simple uniqueness theorem: Let A and B be two integral symmetric matr...
AbstractWe define an inverse eigenvalue problem, which contains as special cases the classical addit...
A spectral inverse problem concerns the reconstruction of parameters of a parent graph from prescrib...
AbstractWe prove that a tree with at least three cutvertices is reconstructible from its cutvertex- ...
AbstractTutte proved that, if two graphs, both with more than two vertices, have the same collection...
AbstractVarious conditions on the eigenvalues and eigenvectors of a graph are found to be sufficient...
This doctoral thesis deals with the reconstruction conjecture in graph theory. This over 70 year old...
In this paper, we study the simple eigenvectors of two hypomorphic matrices using linear algebra. We...
Abstract. We give a bound on the reconstructibility of an action G X in terms of the reconstructibi...
A spectral inverse problem concerns the reconstruction of parameters of a parent graph from prescrib...
AbstractUsing only the set of point-deleted subgraphs, several invariants of a graph are derived. Th...
A graph polynomial P (G, x) is called reconstructible if it is uniquely determined by the polynomia...
AbstractIn this paper, we consider graphs whose deck consists of cards (which are the vertex-deleted...
A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of...
In this paper we show that specific classes of graphs are reconstructible; we explore the relationsh...
AbstractWe prove the following simple uniqueness theorem: Let A and B be two integral symmetric matr...
AbstractWe define an inverse eigenvalue problem, which contains as special cases the classical addit...
A spectral inverse problem concerns the reconstruction of parameters of a parent graph from prescrib...
AbstractWe prove that a tree with at least three cutvertices is reconstructible from its cutvertex- ...
AbstractTutte proved that, if two graphs, both with more than two vertices, have the same collection...
Add to ORKG