RT info:eu-repo/semantics/article
T1 Structural properties of minimal strong digraphs versus trees
A1 García López, J.
A1 Marijuán López, Carlos
A1 Pozo Coronado, Luis Miguel
K1 Digraphs - Discrete mathematics
K1 Dígrafos - Matemáticas discretas
K1 Trees - Discrete mathematics
K1 Árboles - Matemáticas discretas
K1 Characteristic polynomial
K1 Polinomios característicos
K1 Reducible matrices
K1 Matrices reducibles
AB 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, regardingnearly reducible matrices. We give bounds for the coefficients of the characteristic polynomial corresponding to the adjacency matrix of trees, and we conjecturebounds for MSDs. We also propose two different representations of an MSD interms of trees (the union of a spanning tree and a directed forest; and a doubledirected tree whose vertices are given by the contraction of connected Hassediagrams).
PB Elsevier
SN 0024-3795
YR 2018
FD 2018
LK http://uvadoc.uva.es/handle/10324/35971
UL http://uvadoc.uva.es/handle/10324/35971
LA eng
NO Linear Algebra and its Applications, 2018, vol. 540. p. 203-220
NO Producción Científica
DS UVaDOC
RD 26-dic-2024