Revision history [back]

Consider the set of all symmetric matrices of a given size $n$ with entries lying in ${0,1}$ such that all diagonal entries are zeros in the matrices. Now how to write an algorithm that finds a matrix (from the set we have considered) which is similar to its inverse matrix via a permutation matrix.

For computation part, we can choose $n$ according to our convenience.

Please help regarding this. Thank you

Consider the set of all symmetric matrices of a given size $n$ with entries lying in ${0,1}$ {0,1} such that all diagonal entries are zeros in the matrices. Now how to write an algorithm that finds a matrix (from the set we have considered) which is similar to its inverse matrix via a permutation matrix.

For computation part, we can choose $n$ according to our convenience.

Please help regarding this. Thank you

Consider the set of all symmetric matrices of a given size $n$ with entries lying in {0,1} such that all diagonal entries are zeros in the matrices. Now how to write an algorithm that finds a at least one matrix (from the set we have considered) which is similar to its inverse matrix via a permutation matrix.

For computation part, we can choose $n$ according to our convenience.

Please help regarding this. Thank you