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

DOI10.1016/j.laa.2015.09.018zbMath1325.05097OpenAlexW1640856853MaRDI QIDQ890553

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

incidence matrixadjacency matrixtensor productundirected graphconnected componentchainable matrix

Mathematics Subject Classification ID

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

Cites Work

• On the symmetric solutions of linear matrix equations
• The chainable matrix, a special combinatorial matrix
• Towards a Generalized Singular Value Decomposition
• Unnamed Item
• Unnamed Item
• Unnamed Item

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