<?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-18T17:20:24Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/40734" metadataPrefix="ese">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/40734</identifier><datestamp>2021-06-24T07:41:26Z</datestamp><setSpec>com_10324_32197</setSpec><setSpec>com_10324_952</setSpec><setSpec>com_10324_894</setSpec><setSpec>col_10324_32199</setSpec></header><metadata><europeana:record xmlns:europeana="http://www.europeana.eu/schemas/ese/" xmlns:confman="org.dspace.core.ConfigurationManager" xmlns:doc="http://www.lyncode.com/xoai" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.europeana.eu/schemas/ese/ http://www.europeana.eu/schemas/ese/ESE-V3.4.xsd">
<dc:title>Structural and spectral properties of minimal strong digraphs</dc:title>
<dc:creator>Marijuán López, Carlos</dc:creator>
<dc:creator>García López, Jesús</dc:creator>
<dc:creator>Pozo Coronado, Luis Miguel</dc:creator>
<dc:subject>Digraphs</dc:subject>
<dc:subject>Dígrafos</dc:subject>
<dc:subject>Trees</dc:subject>
<dc:subject>Árboles</dc:subject>
<dc:subject>Characteristic polynomial</dc:subject>
<dc:subject>Polinomio característico</dc:subject>
<dc:description>Producción Científica</dc:description>
<dc:description>In this article, we focus on structural and spectral properties of minimal strong&#xd;
digraphs (MSDs). We carry out a comparative study of properties of MSDs versus&#xd;
trees. This analysis includes two new properties. The first one gives bounds on&#xd;
the coefficients of characteristic polynomials of trees (double directed trees), and&#xd;
conjectures the generalization of these bounds to MSDs. As a particular case, we&#xd;
prove that the independent coemcient of the characteristic polynomial of a tree or&#xd;
an MSD must be — 1, 0 or 1. For trees, this fact means that a tree has at most one&#xd;
perfect matching; for MSDs, it means that an MSD has at most one covering by&#xd;
disjoint cycles. The property states that every MSD can be decomposed in a rooted&#xd;
spanning tree and a forest of reversed rooted trees, as factors. In our opinión, the&#xd;
analogies described suppose a significative change in the traditional point of view&#xd;
about this class of digraphs.</dc:description>
<dc:description>Ministerio de Economía, Industria y Competitividad (project MTM2015-65764-C3-1-P)</dc:description>
<dc:date>2020-04-13T13:11:53Z</dc:date>
<dc:date>2020-04-13T13:11:53Z</dc:date>
<dc:date>2016</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/acceptedVersion</dc:type>
<dc:identifier>Electronic Notes in Discrete Mathematics, 2016, vol. 54. p. 91-96</dc:identifier>
<dc:identifier>1571-0653</dc:identifier>
<dc:identifier>http://uvadoc.uva.es/handle/10324/40734</dc:identifier>
<dc:identifier>10.1016/j.endm.2016.09.017</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>https://www.sciencedirect.com/science/article/abs/pii/S1571065316301111</dc:relation>
<dc:rights>Attribution-NonCommercial-NoDerivatives 4.0 Internacional</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:rights>© 2016 Elsevier</dc:rights>
<dc:format>application/pdf</dc:format>
<dc:publisher>Elsevier</dc:publisher>
<europeana:object>https://uvadoc.uva.es/bitstream/10324/40734/4/Structural-and-spectral-properties.pdf.jpg</europeana:object>
<europeana:provider>Hispana</europeana:provider>
<europeana:type>TEXT</europeana:type>
<europeana:rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</europeana:rights>
<europeana:dataProvider>UVaDOC. Repositorio Documental de la Universidad de Valladolid</europeana:dataProvider>
<europeana:isShownAt>http://uvadoc.uva.es/handle/10324/40734</europeana:isShownAt>
</europeana:record></metadata></record></GetRecord></OAI-PMH>