α₀-Graph of a Graph

The minimum covering sets of a graph may be used to create a new graph. The vertices of the new graph are of course the minimum covering sets of the original graph and two such vertices will be adjacent if in the corresponding minimum covering sets, one can move from one of them to other by deletion of a vertex and addition of another vertex. This new graph is called the α₀-graph of the given graph. This paper makes a study of α₀-graph of a graph.