All Questions
1
question
1
vote
0
answers
697
views
Counting problem of combinations of symmetric matrix.
Given, a symmetric $n*n$ matrix $G$ with 0,1 entries. Each row of has same number of 1. $G$ is arranged in a certain order using a rule. The rule is described below-
$G$ is partitioned in to two sub ...
- 499