2022-01-12 18:43:53 +0200 | received badge | ● Notable Question (source) |
2020-07-14 15:19:07 +0200 | received badge | ● Popular Question (source) |
2019-08-01 11:21:31 +0200 | asked a question | Automorphism group of edge symmetry I asked a similar question before, https://ask.sagemath.org/question/427... I am curious that is there any similar function for finding "edge symmetry"? Note: the link I provided is for "node symmetry" in a network (graph). |
2018-06-28 03:22:14 +0200 | asked a question | Automorphism group of weighted graph I know we can use sage to find the group of automorphisms of a graph $G$: However, the above way can only be used to the unweighted graph. So for example: The result is: However, this result is not correct (correct for unweighted case). This is because $AD\neq DA$, where $$D = \begin{bmatrix} 0 & 0 & 1 \\ 0 & 1 & 0 \\ 1 & 0 & 0\end{bmatrix},$$ which is a permutation matrix and $$A = \begin{bmatrix} 0 & 10 & 0 \\ 10 & 0 & 1 \\ 0 & 1 & 0\end{bmatrix},$$ which is an adjacency matrix. Can we use SAGE to find the group of automorphisms of a graph? |
2018-06-17 20:08:23 +0200 | received badge | ● Scholar (source) |
2018-06-17 20:08:19 +0200 | received badge | ● Supporter (source) |
2018-06-17 07:23:30 +0200 | received badge | ● Editor (source) |
2018-06-17 01:01:45 +0200 | received badge | ● Student (source) |
2018-06-17 01:00:37 +0200 | asked a question | About SymmetricGroupRepresentation() I am a new student in SAGE. I read the following discussion: However, I am still confused about some fundamental problem:
However, if I use 'orthogonal' instead of 'specht', the answer becomes $$\begin{bmatrix}1 & 0 \\ 0 & 1\end{bmatrix}$$ But I test another permutation: $[1,2,3]$, the answer is the same. However, $[1,2]$ and $[1,2,3]$ are in the different conjugacy classes; they should not have the same character. I cannot find "Permutation" in "Sage Reference Manual: Group". Where can I find this function? |