When I saw the question “What is the most efficient algorithm to sample graphs with trivial automorphism groups ?” by turkistany, it reminded me that I saw a similar question recently, but it was difficult to find which question it was. It turned out that the “similar” question was “Generating Graphs with Trivial Automorphisms” by Sadeq (which was indeed related, but was not similar after all).
Part of the difficulty of finding this question was due to the fact that the former had a tag [automorphism] while the latter had [graph-isomorphism], which rendered tag search useless. (Of course part of the difficulty is due to my poor searching skill.)
At this moment, there are five questions with the tag [automorphism], and all of them seem to be about the automorphisms of a graph. Considering that graph isomorphisms and graph automorphisms are obviously very closely related, it makes some sense to merge these tags, which would have avoided the difficulty I encountered.
However, converting [automorphism] into a tag synonym of [graph-isomorphism] does not sound right for the future use.
Converting both tags into a tag synonym of a new tag [isomorphism] is another option. However, [isomorphism] is a little vague, and it can refer to the isomorphisms between languages as in the Berman-Hartmanis isomorphism conjecture for example.
Leaving these tags as they are is also a valid option.
What should we do about these tags?