power graph;
planar graph;
Eulerian graph;
finite group;
D O I:
暂无
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
Let G he a group. The power graph Gamma(P)(G) of G is a graph with vertex set V(Gamma(P)(G)) = G and two distinct vertices x and y are adjacent, in Gamma P(G) if and only if either x(i) = y or y(j) = x, where 2 <= i,j <= n. In this paper, we obtain some fundamental characterizations of the power graph. Also, we characterize certain classes of power graphs of finite abelian groups.