On the tree-number of the power graph associated with a finite groups
arXiv:2212.04695
Abstract
Given a group , we define the power graph as follows: the vertices are the elements of and two vertices and are joined by an edge if or . Obviously the power graph of any group is always connected, because the identity element of the group is adjacent to all other vertices. We consider , the number of spanning trees of the power graph associated with a finite group . In this paper, for a finite group , first we represent some properties of , then we are going to find some divisors of , and finally we prove that the simple group is uniquely determined by tree-number of its power graph among all finite simple groups.