The number of connected components in a graph associated with a rectangular (0,1)-matrix

DOI10.1016/J.LAA.2015.09.018MaRDI QIDQ890553zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 10 November 2015

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

Full work available at URL https://doi.org/10.1016/j.laa.2015.09.018

zbMATH Keywords

tensor productadjacency matrixconnected componentincidence matrixundirected graphchainable matrix

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Connectivity (05C40) Matrix equations and identities (15A24)

Recommendations

• scientific article; zbMATH DE number 15252
• scientific article; zbMATH DE number 4075286
• scientific article; zbMATH DE number 4089595
• Connections between graphs and matrix spaces
• Minimum-rank matrices with prescribed graph

Cites work

• A new proof of generalized singular-value decomposition
• Combinatorial matrix theory
• Matrix mathematics. Theory, facts, and formulas
• On the symmetric solutions of linear matrix equations
• The chainable matrix, a special combinatorial matrix
• Towards a Generalized Singular Value Decomposition

Cited in

(1)

• scientific article; zbMATH DE number 4212087 (Why is no real title available?)

This page was built for publication: The number of connected components in a graph associated with a rectangular \((0,1)\)-matrix

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