Community Profile

photo

Maxwell Day


Last seen: 2 years ago |  Active since 2020

Followers: 0   Following: 0

Statistics

  • Thankful Level 1

View badges

Feeds

View by

Question


Equalizing edge lengths in simple graphs
I would like to generate a graph from an adjacency matrix in which each edge of the graph is forced to be the same length. The s...

2 years ago | 0 answers | 0

0

answers

Question


Generating non-isomorphic graphs with 6-8 nodes of specified degrees
I would like to increase the efficiency (reduce execution time) of my existing code (attached) for generating all non-isomorphic...

3 years ago | 0 answers | 0

0

answers

Question


Generating all non-isomorphic graphs with 5-8 nodes with specified degrees
I would like to generate the set of all possible, non-isomorphic graphs for a given number of nodes (n) with specified degrees. ...

3 years ago | 0 answers | 0

0

answers

Question


Generating all non-isomorphic graphs for a given number of nodes with specified degrees
I would like to generate the set of all possible, non-isomorphic graphs for a given number of nodes (n) with specified degrees. ...

3 years ago | 1 answer | 0

1

answer

Answered
Permuting elements in an symmetrical matrix with restricted outcomes
Hello @Adam Danz I seem to be running into error related to exceeding the maximum array size with a 6 x 6 matrix, I was under t...

4 years ago | 0

Answered
Permuting elements in an symmetrical matrix with restricted outcomes
Hey @Adam Danz The code is working great so far thanks again. I have another interesting problem if you are interested. After ...

4 years ago | 0

Question


Permuting elements in an symmetrical matrix with restricted outcomes
I would like to derive all possible permutations of a matrix A = [0 2 0 1; 2 0 1 0; 0 1 0 1; 1 0 1 0] by permuting the positions...

4 years ago | 3 answers | 1

3

answers