Let G be a finite group.The power graph of G is a graph with vertex set G and two distinct vertex x and y are adjacent if and only if exists positive number m,n such that xm=y or yn=x.In this paper,we define the type and type length of a simple undirected graph.Several conclusions are given for the groups of power graphs with smaller type lengths,and some properties of quotient group power graphs are also proved.
NETL
NSTL
万方数据
