Comellas, Francesc; Mitjana, Margarida The spectra of cycle prefix digraphs. (English) Zbl 1029.05095 SIAM J. Discrete Math. 16, No. 3, 418-421 (2003). Summary: Cycle prefix digraphs comprise a class of vertex symmetric digraphs with many interesting properties, such as large order for a given degree and diameter, Hamiltonicity, and hierarchical structure. From their known structural properties, we determine the spectra of the digraphs. We also show that, although cycle prefix digraphs are not distance regular according to the usual definition, they have properties that fully characterize, in the undirected case, distance regular graphs. Cited in 4 Documents MSC: 05C50 Graphs and linear algebra (matrices, eigenvalues, etc.) 05C20 Directed graphs (digraphs), tournaments 05C12 Distance in graphs 05C75 Structural characterization of families of graphs 15A18 Eigenvalues, singular values, and eigenvectors Keywords:directed graphs; cycle prefix digraph; adjacency matrix; eigenvalues PDFBibTeX XMLCite \textit{F. Comellas} and \textit{M. Mitjana}, SIAM J. Discrete Math. 16, No. 3, 418--421 (2003; Zbl 1029.05095) Full Text: DOI