On -walk-regular graphs.
Dalfó, C., Fiol, M.A., Garriga, E. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes.”
On -walk-regular graphs.
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:
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:
An eigenvalue characterization of antipodal distance-regular graphs.
Fiol, M.A. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Combinatorial vs. algebraic characterizations of completely pseudo-regular codes.
Camara, M., Fabrega, J., Fiol, M.A., Garriga, E. (2010)
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:
A quasi-spectral characterization of strongly distance-regular graphs.
Fiol, M.A. (2000)
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:
On the number of orthogonal systems in vector spaces over finite fields.
Le Anh Vinh (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A matrix representation of graphs and its spectrum as a graph invariant.
Emms, David, Hancock, Edwin R., Severini, Simone, Wilson, Richard C. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On regular factors in regular graphs with small radius.
Hoffmann, Arne, Volkmann, Lutz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The strongly regular (40, 12, 2, 4) graphs.
Spence, E. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bounded-degree graphs can have arbitrarily large slope numbers.
Pach, János, Pálvölgyi, Dömötör (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: