Minimal strong digraphs

DOI10.1016/j.disc.2011.11.010zbMath1238.05105arXiv1004.4827OpenAlexW1970413490MaRDI QIDQ409422

Jesús García-López, Carlos Marijuán

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.4827

zbMATH Keywords

isospectral strong digraphsminimal strong digraphsstrong digraphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items

Simple dynamics on graphs, Structure of cycles in minimal strong digraphs, Structural properties of minimal strong digraphs versus trees, Structural and spectral properties of minimal strong digraphs

Uses Software

• nauty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The nonnegative inverse eigenvalue problem from the coefficients of the characteristic polynomial. EBL digraphs
• A unified treatment of nearly reducible and nearly decomposable matrices
• Parallel concepts in graph theory
• A special class of irreducible matrices. The nearly reducible matrices
• On minimal strong blocks
• Decomposition of Directed Graphs
• Counting strong digraphs
• On basis diagraphs
• Minimally 2-connected graphs.
• On Minimal Blocks
• Minimally strong digraphs
• A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices
• The Number of Strong Digraphs