Structural properties of minimal strong digraphs versus trees

DOI10.1016/j.laa.2017.11.027zbMath1377.05076OpenAlexW2775808190MaRDI QIDQ1688914

Jesús García-López, L. M. Pozo Coronado, Carlos Marijuán

Publication date: 12 January 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: http://uvadoc.uva.es/handle/10324/35971

zbMATH Keywords

characteristic polynomialtreesminimal strong digraphsnearly reducible matrices

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items

Structure of cycles in minimal strong digraphs, Geometric and spectral analysis on weighted digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal strong digraphs
• Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
• The nonnegative inverse eigenvalue problem from the coefficients of the characteristic polynomial. EBL digraphs
• Sur les arborescences dans un graphe oriente
• A unified treatment of nearly reducible and nearly decomposable matrices
• Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
• A special class of irreducible matrices. The nearly reducible matrices
• On basis diagraphs
• Minimally 2-connected graphs.
• On Minimal Blocks
• Minimally strong digraphs
• A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices