Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1137/S0895480100380604 | SIAM J. Discrete Math. |
Keywords | Field | DocType |
cycle prefix digraph,hierarchical structure,regular graph,vertex symmetric digraph,usual definition,undirected case,interesting property,cycle prefix digraphs,structural property,large order,eigenvalues,adjacency matrix,directed graphs | Adjacency matrix,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Directed graph,Prefix,Regular graph,Eigenvalues and eigenvectors,Mathematics | Journal |
Volume | Issue | ISSN |
16 | 3 | 0895-4801 |
Citations | PageRank | References |
1 | 0.43 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francesc Comellas | 1 | 155 | 25.07 |
| Margarida Mitjana | 2 | 37 | 7.82 |