The spectra of subKautz and cyclic Kautz digraphs
MetadataShow full item record
Kautz digraphs K(d, `) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz CK(d, `) and the subKautz sK(d, 2) digraphs were recently introduced by B¨ohmov´a, Huemer and the author. In this paper we propose
a new method to obtain the complete spectra of subKautz sK(d, 2) and cyclic Kautz CK(d, 3) digraphs, for all d ≥ 3, through the HoffmanMcAndrew polynomial and regular partitions. This approach can be useful to find the spectra of other families of digraphs with high regularity.
Is part ofLinear Algebra and its Applications, 2017, vol. 531, p. 210-219
The following license files are associated with this item:
Showing items related by title, author, creator and subject.
Dalfó, Cristina; Fiol, Miguel Angel; Sirán, Jozef (Springer, 2019-01-02)We present a method to derive the complete spectrum of the lift Γα of a base digraph Γ , with voltage assignment α on a (finite) group G. The method is based on assigning to Γ a quotient-like matrix whose entries are ...
Dalfó, Cristina (World Scientific Publishing, 2018)Kautz digraphs K(d, l) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d, l) were recently introduced by ...
Dalfó, Cristina; Fiol, Miguel Angel (Elsevier, 2020)In this paper, we present a method to obtain regular (or equitable) partitions of Cayley (di)graphs (that is, graphs, digraphs, or mixed graphs) of permutation groups on n letters. We prove that every partition of the ...