Given adjacency matrix $A$ of a graph is there a name for permutations $P$ such that $A=PAP'$?
Is this an automrphic permutation?
Given adjacency matrix $A$ of a graph is there a name for permutations $P$ such that $A=PAP'$?
Is this an automrphic permutation?
Copyright © 2021 JogjaFile Inc.