Automorphism group of 2-token graph of the Hamming graph

被引:0
|
作者
Zhang, Ju [1 ]
Zhou, Jin-Xin [1 ]
Lee, Jaeun [2 ]
Li, Yan-Tao [3 ]
Xie, Jin-Hua [1 ]
机构
[1] Beijing Jiaotong Univ, Dept Math, Beijing 100044, Peoples R China
[2] Yeungnam Univ, Dept Math, 280 Daehak Ro, Gyongsan 38541, Gyeongbuk, South Korea
[3] Beijing Union Univ, Coll Appl Arts & Sci, Dept Urban Sci, Beijing 100191, Peoples R China
基金
中国国家自然科学基金; 新加坡国家研究基金会;
关键词
Hamming graph; 2-token graphs; Automorphism group;
D O I
10.1016/j.disc.2023.113689
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let G be a graph. The 2 -token graph F2(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. (c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:10
相关论文
共 50 条