2021-12-15T12:55:51Z
2021-12-15T12:55:51Z
2016-07
A digraph Γ =(V, E) is a line digraph when every pair of vertices u, v∈V have either equal or disjoint in-neighborhoods. When this condition only applies for vertices in a given subset (with at least two elements), we say that Γ is a locally line digraph. In this paper we give a new method to obtain a di-graph Γ′ cospectral with a given locally line digraph Γ with diameter D, where the diameter D′ of Γ′ is in the interval [D−1, D+1]. In particular, when the method is applied to De Bruijn or Kautz digraphs, we obtain cospectral digraphs with the same algebraic properties that characterize the formers.
This research is supported by the Ministerio de Ciencia e Innovación and the European Regional Development Fund under project MTM2014-60127-P, and the Catalan Research Council under project 2014SGR1147.
Article
Accepted version
English
Digraph; Adjacency matrix; Spectrum; Cospectral digraph; Diameter; De Bruijn digraph; Kautz digraph
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: https://doi.org/10.1016/j.laa.2016.03.014
Linear Algebra and its Applications, 2016, vol. 500, p. 52-62
cc-by-nc-nd (c) Elsevier, 2016
http://creativecommons.org/licenses/by-nc-nd/4.0/
Documents de recerca [18400]