Power graph of a finite group is always divisor graph

Abstract

The power graph is a special type undirected simple graph of a finite group G which has the group elements as its vertex set and two distinct vertices [Formula: see text] are adjacent if one is non-negative integral power of other. Vertex labeling of graph [Formula: see text] is a process of assigning integers to all its vertices subject to certain conditions. In simple words, vertex (edge) labeling is a function of all vertices (edges) to set of labels. Frequently, integers are used in labeling of vertices and edges. A graph [Formula: see text] is said to be divisor graph if all vertices of graph can be labeled with positive integers such that any two distinct vertices [Formula: see text] are adjacent if and only if either [Formula: see text] or [Formula: see text]. In this research paper, we prove that every power graph of finite group is always a divisor graph, but converse is not true.