A Note on the Order of Iterated Line Digraphs

DOI10.1002/jgt.22068zbMath1373.05076arXiv1607.08832OpenAlexW2963661428WikidataQ60691702 ScholiaQ60691702MaRDI QIDQ5272924

C. Dalfó, Miquel Àngel Fiol

Publication date: 5 July 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.08832

zbMATH Keywords

recurrenceadjacency matrixminimal polynomialline digraphregular partitionquotient digraph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

The spectra of subKautz and cyclic Kautz digraphs ⋮ A general method to obtain the spectrum and local spectra of a graph from its regular partitions

Uses Software

• OEIS

Cites Work

• Line Digraph Iterations and the (d, k) Digraph Problem
• Unnamed Item

This page was built for publication: A Note on the Order of Iterated Line Digraphs