Hello All, I was wondering how I would create a systematic Matrix Generator which goes element by element in order to generate All Graphs of Node Size 3 which have these properties:
1) All entries are a 0 or 1
2) Each Element where m = n (diagonal) must equal 0
3) There must exist at least a single "1" in each row and column
4) Entries across the diagonal must be opposite:
For example, If A(1,2) = 1 then A(2,1) must Equal 0
The generator must be able to store all of its generated graphs for later use and analysis
Best Answer