Some properties of square roots for a Boolean matrix

DOI10.3969/J.ISSN.1001-8395.2012.02.004MaRDI QIDQ4901192zbMATH OpenFDO

Authors Yan Yang, Chao Min, Qingquan Xiong

Publication date 24 January 2013

Full work available at URL https://doi.org/10.3969/J.ISSN.1001-8395.2012.02.004

zbMATH Keywords

Boolean matrixcombinatorial optimizationsquare rootsufficient and necessary condition

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Boolean and Hadamard matrices (15B34) Combinatorial optimization (90C27)

Recommendations

• Boolean matrix root computing and the relations between square roots of Boolean matrices and chromatic partitions of graphs
• scientific article; zbMATH DE number 32014
• Determinants of the powers of Boolean matrices
• The complexity of Boolean matrix root computation
• The complexity of Boolean matrix root computation

Cited in

(4)

• The complexity of Boolean matrix root computation
• The complexity of Boolean matrix root computation
• scientific article; zbMATH DE number 32014 (Why is no real title available?)
• Boolean matrix root computing and the relations between square roots of Boolean matrices and chromatic partitions of graphs

This page was built for publication: Some properties of square roots for a Boolean matrix

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