2024-03-29T12:46:18Zhttps://uvadoc.uva.es/oai/requestoai:uvadoc.uva.es:10324/359712021-06-24T07:40:55Zcom_10324_32197com_10324_952com_10324_894col_10324_32199
Structural properties of minimal strong digraphs versus trees
García López, J.
Marijuán López, Carlos
Pozo Coronado, Luis Miguel
In this article, we focus on structural properties of minimal strong digraphs
(MSDs). We carry out a comparative study of properties of MSDs versus (undirected) trees. For some of these properties, we give the matrix version, regarding
nearly reducible matrices. We give bounds for the coefficients of the characteristic polynomial corresponding to the adjacency matrix of trees, and we conjecture
bounds for MSDs. We also propose two different representations of an MSD in
terms of trees (the union of a spanning tree and a directed forest; and a double
directed tree whose vertices are given by the contraction of connected Hasse
diagrams).
2019-05-08T07:44:37Z
2019-05-08T07:44:37Z
2019-05-08T07:44:37Z
2018
info:eu-repo/semantics/article
Linear Algebra and its Applications, 2018, vol. 540. p. 203-220
0024-3795
http://uvadoc.uva.es/handle/10324/35971
https://doi.org/10.1016/j.laa.2017.11.027
eng
https://www.sciencedirect.com/science/article/pii/S0024379517306559?via%3Dihub
info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-nd/4.0/
© 2018 Elsevier
Attribution-NonCommercial-NoDerivatives 4.0 International
Elsevier