AbstractWe prove that there is a unique graph (on 56 vertices) with spectrum 101235(-4)20 and examine its structure. It turns out that, e.g., the Coxeter graph (on 28 vertices) and the Sylvester graph (on 36 vertices) are induced subgraphs. We give descriptions of this graph
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The e...
AbstractThis paper contains a table of 112 connected graphs on six vertices. The graphs are ordered ...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
We prove that there is a unique graph (on 56 vertices) with spectrum 101235(-4)20 and examine its st...
AbstractWe prove that there is a unique graph (on 81 vertices) with spectrum 201260(−7)20. We give s...
We prove that there is a unique graph (on 81 vertices) with spectrum 201260(-7)20. We give several d...
We show that there is a unique graph with spectrum as in the title. It is a subgraph of the McLaughl...
We give a new proof that there exists a unique strongly regular graph with parameters (81, 20, 1, 6)...
AbstractWe give a new proof that there exists a unique strongly regular graph with parameters (81,20...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
AbstractGraphs with a few distinct eigenvalues usually possess an interesting combinatorial structur...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. In this paper regula...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
Given a graph G we can form a matrix A_G indexed by the vertices of G and which encodes the edges of...
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary...
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The e...
AbstractThis paper contains a table of 112 connected graphs on six vertices. The graphs are ordered ...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
We prove that there is a unique graph (on 56 vertices) with spectrum 101235(-4)20 and examine its st...
AbstractWe prove that there is a unique graph (on 81 vertices) with spectrum 201260(−7)20. We give s...
We prove that there is a unique graph (on 81 vertices) with spectrum 201260(-7)20. We give several d...
We show that there is a unique graph with spectrum as in the title. It is a subgraph of the McLaughl...
We give a new proof that there exists a unique strongly regular graph with parameters (81, 20, 1, 6)...
AbstractWe give a new proof that there exists a unique strongly regular graph with parameters (81,20...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
AbstractGraphs with a few distinct eigenvalues usually possess an interesting combinatorial structur...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. In this paper regula...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
Given a graph G we can form a matrix A_G indexed by the vertices of G and which encodes the edges of...
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary...
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The e...
AbstractThis paper contains a table of 112 connected graphs on six vertices. The graphs are ordered ...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
DOI
Add to ORKG