<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-17T06:47:38Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:10459.1/72568" metadataPrefix="qdc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:10459.1/72568</identifier><datestamp>2024-12-05T22:52:34Z</datestamp><setSpec>com_2072_3622</setSpec><setSpec>col_2072_479130</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Cospectral digraphs from locally line digraphs</dc:title>
   <dc:creator>Dalfó, Cristina</dc:creator>
   <dc:creator>Fiol Mora, Miguel Ángel</dc:creator>
   <dc:subject>Digraph</dc:subject>
   <dc:subject>Adjacency matrix</dc:subject>
   <dc:subject>Spectrum</dc:subject>
   <dc:subject>Cospectral digraph</dc:subject>
   <dc:subject>Diameter</dc:subject>
   <dc:subject>De Bruijn digraph</dc:subject>
   <dc:subject>Kautz digraph</dc:subject>
   <dcterms:abstract>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.</dcterms:abstract>
   <dcterms:abstract>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.</dcterms:abstract>
   <dcterms:dateAccepted>2024-12-05T22:52:34Z</dcterms:dateAccepted>
   <dcterms:available>2024-12-05T22:52:34Z</dcterms:available>
   <dcterms:created>2024-12-05T22:52:34Z</dcterms:created>
   <dcterms:issued>2021-12-15T12:55:51Z</dcterms:issued>
   <dcterms:issued>2021-12-15T12:55:51Z</dcterms:issued>
   <dcterms:issued>2016-07</dcterms:issued>
   <dc:type>info:eu-repo/semantics/article</dc:type>
   <dc:type>info:eu-repo/semantics/acceptedVersion</dc:type>
   <dc:identifier>http://hdl.handle.net/10459.1/72568</dc:identifier>
   <dc:relation>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/</dc:relation>
   <dc:relation>Versió postprint del document publicat: https://doi.org/10.1016/j.laa.2016.03.014</dc:relation>
   <dc:relation>Linear Algebra and its Applications, 2016, vol. 500, p. 52-62</dc:relation>
   <dc:rights>cc-by-nc-nd (c) Elsevier, 2016</dc:rights>
   <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
   <dc:publisher>Elsevier</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>