English

Strong metric dimensions for power graphs of finite groups

Combinatorics 2021-04-29 v2

Abstract

Let GG be a finite group. The order supergraph of GG is the graph with vertex set GG, and two distinct vertices x,yx,y are adjacent if o(x)o(y)o(x)\mid o(y) or o(y)o(x)o(y)\mid o(x). The enhanced power graph of GG is the graph whose vertex set is GG, and two distinct vertices are adjacent if they generate a cyclic subgroup. The reduced power graph of GG is the graph with vertex set GG, and two distinct vertices x,yx,y are adjacent if xy\langle x\rangle \subset \langle y\rangle or yx\langle y\rangle \subset \langle x\rangle. In this paper, we characterize the strong metric dimension of the order supergraph, the enhanced power graph and the reduced power graph of a finite group.

Keywords

Cite

@article{arxiv.2005.03829,
  title  = {Strong metric dimensions for power graphs of finite groups},
  author = {Xuanlong Ma and Liangliang Zhai},
  journal= {arXiv preprint arXiv:2005.03829},
  year   = {2021}
}

Comments

This is the final version to be published in Communications in Algebra, 16 pages