The spectral excess theorem for distance-regular graphs: a global (over)view.
van Dam, Edwin R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Some applications of the proper and adjacency polynomials in the theory of graph spectra.”
The spectral excess theorem for distance-regular graphs: a global (over)view.
Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes.
Cámara, M., Fàbrega, J., Fiol, M.A., Garriga, E. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An eigenvalue characterization of antipodal distance-regular graphs.
Fiol, M.A. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On -walk-regular graphs.
Dalfó, C., Fiol, M.A., Garriga, E. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A quasi-spectral characterization of strongly distance-regular graphs.
Fiol, M.A. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The matching polynomial of a distance-regular graph.
Beezer, Robert A., Farrell, E.J. (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Metrically regular square of metrically regular bigraphs. I
Vladimír Vetchý (1991)
Archivum Mathematicum
Similarity:
On regular factors in regular graphs with small radius.
Hoffmann, Arne, Volkmann, Lutz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some Comments on the Eigenspaces of Graphs
Dragoš M. Cvetković (1991)
Publications de l'Institut Mathématique
Similarity:
Smallest Regular Graphs of Given Degree and Diameter
Martin Knor (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this note we present a sharp lower bound on the number of vertices in a regular graph of given degree and diameter.