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:
Displaying similar documents to “On -walk-regular graphs.”
Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes.
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:
Some applications of the proper and adjacency polynomials in the theory of graph spectra.
Fiol, M.A. (1997)
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:
A quasi-spectral characterization of strongly distance-regular graphs.
Fiol, M.A. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Large holes in quasi-random graphs.
Polcyn, Joanna (2008)
The Electronic Journal of Combinatorics [electronic only]
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:
A characterization for sparse -regular pairs.
Gerke, Stefanie, Steger, Angelika (2007)
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:
The strongly regular (40, 12, 2, 4) graphs.
Spence, E. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity: