The spectra of subKautz and cyclic Kautz digraphs

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 propo...

Descripción completa

Detalles Bibliográficos
Autor: Dalfó, Cristina
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2017
País:España
Institución:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10459.1/65485
Acceso en línea:https://doi.org/10.1016/j.laa.2017.05.046
http://hdl.handle.net/10459.1/65485
Access Level:acceso abierto
Palabra clave:Digraph
Kautz digraph
Adjacency matrix
Descripción
Sumario: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.