Abstract
Let G be a graph. The 2-token graphF2(G) of G is with vertex set all the 2-subsets of V(G) such that two 2-subsets are adjacent if their symmetric difference is exactly an edge of G. In this paper, the full automorphism group of the 2-token graph of the Hamming graph is determined.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
