Structural properties of minimal strong digraphs versus trees
type: Item
instance of: scholarly article
title: Structural properties of minimal strong digraphs versus trees
zbMATH Open document ID: 1377.05076
published in: Linear Algebra and its Applications
publication date: 2018-01-12T00:00:00Z
full work available at URL: http://uvadoc.uva.es/handle/10324/35971
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6824956
zbMATH Keywords: minimal strong digraphs
zbMATH Keywords: trees
zbMATH Keywords: characteristic polynomial
zbMATH Keywords: nearly reducible matrices
author: J. García-López
author: C. Marijuán
author: Luis M. Pozo Coronado
MaRDI profile type: Publication
OpenAlex ID: W2775808190
cites work: Q4500916
cites work: Q5615282
cites work: Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
cites work: Q5422499
cites work: A unified treatment of nearly reducible and nearly decomposable matrices
cites work: Minimally 2-connected graphs.
cites work: Minimal strong digraphs
cites work: Minimally strong digraphs
cites work: On basis diagraphs
cites work: A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices
cites work: Q4050633
cites work: A special class of irreducible matrices. The nearly reducible matrices
cites work: Sur les arborescences dans un graphe oriente
cites work: On Minimal Blocks
cites work: The nonnegative inverse eigenvalue problem from the coefficients of the characteristic polynomial. EBL digraphs
cites work: Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
DOI: 10.1016/J.LAA.2017.11.027
description: scientific article; zbMATH DE number 6824956