Timeline for Can we count isospectral graphs?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 27, 2014 at 13:13 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 467 characters in body
|
| Sep 27, 2014 at 7:44 | comment | added | user6818 | @BrendonMcKay the issue is can I (1) maintain d-regularity and (2) if I restrict to unweighted graphs then can I do something like this (as in always maintain that the adjacency matrices I produce are always 1.0 matrices.) | |
| Sep 27, 2014 at 7:43 | comment | added | user6818 | @Brendon McKay Thanks! Any insights about the second question? I mean - an obvious thing to try is this - say I take the adjacency matrix "A" and then conjugate it by some matrix then I get another matrix which is isospectral to whatever I began with - if I choose the conjugating matrix to be orthogonal then I can possibly ensure that symmetricity of the original matrix is maintained - so it seems one can create another graph isospectral to the original - | |
| Sep 27, 2014 at 7:14 | history | answered | Brendan McKay | CC BY-SA 3.0 |