Structural and spectral properties of minimal strong digraphs

DOI10.1016/j.endm.2016.09.017zbMath1356.05062OpenAlexW2536998366MaRDI QIDQ510549

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

Publication date: 13 February 2017

Full work available at URL: http://oa.upm.es/46081/

zbMATH Keywords

characteristic polynomialspanning treeminimal strong digraphs

Mathematics Subject Classification ID

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

Cites Work

• 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
• Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
• Unnamed Item
• Unnamed Item