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.
This research is supported by MINECO under project MTM2014-60127-P, and the Catalan Research Council under project 2014SGR1147. This research has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No 734922.
Anglès
Digraph; Kautz digraph; Adjacency matrix
Elsevier
info:eu-repo/grantAgreement/MINECO//MTM2014-60127-P/ES/TECNICAS DE OPTIMIZACION EN TEORIA DE GRAFOS, GRUPOS Y COMBINATORIA. APLICACIONES A REDES, ALGORITMOS Y PROTOCOLOS DE COMUNICACION/
Versió postprint del document publicat a https://doi.org/10.1016/j.laa.2017.05.046
Linear Algebra and its Applications, 2017, vol. 531, p. 210-219
info:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECT
cc-by-nc-nd (c) Elsevier, 2017
http://creativecommons.org/licenses/by-nc-nd/3.0/es
Documents de recerca [17848]