Algebraic characterization of strongly connected graphs

MaRDI QIDQ4904741zbMATHFDO

Authors Zhivko Nedev

Publication date 31 January 2013

Full work available at URL http://www.ijpam.eu/contents/2012-81-1/1/index.html

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A characterization of graphs with rank 5
• The rank of connection matrices and the dimension of graph algebras
• A characterization of graphs with rank 4
• A characterization of long graphs of arbitrary rank
• Minimum-rank matrices with prescribed graph

Cited in

(3)

• Matrix functions in network analysis
• Uniformly sparse graphs and matrices
• The rank of connection matrices and the dimension of graph algebras

This page was built for publication: Algebraic characterization of strongly connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904741)