<?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-14T07:41:56Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:10459.1/69200" metadataPrefix="oai_dc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:10459.1/69200</identifier><datestamp>2024-12-05T22:43:43Z</datestamp><setSpec>com_2072_3622</setSpec><setSpec>col_2072_479130</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>New Moore-Like Bounds and Some Optimal Families of Abelian Cayley Mixed Graphs</dc:title>
   <dc:creator>Dalfó, Cristina</dc:creator>
   <dc:creator>Fiol Mora, Miguel Ángel</dc:creator>
   <dc:creator>López Lorenzo, Ignacio</dc:creator>
   <dc:subject>Mixed graph</dc:subject>
   <dc:subject>Moore bound</dc:subject>
   <dc:subject>Abelian group</dc:subject>
   <dc:subject>Congruences in Zn</dc:subject>
   <dc:description>Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are Cayley graphs of abelian groups. Such groups can be constructed using a generalization to Zn of the concept of congruence in Z. Here we use this approach to present some families of mixed graphs, which, for every fixed value of the degree, have an asymptotically large number of vertices as the diameter increases. In some cases, the results obtained are shown to be optimal.</dc:description>
   <dc:description>The research of C. Dalfó has also received funding from the European&#xd;
Union’s Horizon 2020 research and innovation programme under the Marie&#xd;
Sklodowska-Curie Grant agreement no. 734922.</dc:description>
   <dc:date>2020-07-02T09:19:36Z</dc:date>
   <dc:date>2021-06-07T22:26:28Z</dc:date>
   <dc:date>2020-06-06</dc:date>
   <dc:date>2020-07-02T09:19:36Z</dc:date>
   <dc:type>info:eu-repo/semantics/article</dc:type>
   <dc:type>info:eu-repo/semantics/acceptedVersion</dc:type>
   <dc:identifier>https://doi.org/10.1007/s00026-020-00496-2</dc:identifier>
   <dc:identifier>0218-0006</dc:identifier>
   <dc:identifier>http://hdl.handle.net/10459.1/69200</dc:identifier>
   <dc:identifier>http://hdl.handle.net/10459.1/69200</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>Versió postprint del document publicat a: https://doi.org/10.1007/s00026-020-00496-2</dc:relation>
   <dc:relation>Annals Of Combinatorics, 2020, vol. 24, num. 2, p. 405-424</dc:relation>
   <dc:relation>info:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECT</dc:relation>
   <dc:rights>(c) Springer Nature Switzerland AG, 2020</dc:rights>
   <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
   <dc:format>application/pdf</dc:format>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>