Edge Partition of the Boolean Graph BG1(G)

Abstract

Let G be a simple (p, q) graph with vertex set V(G) and edge set E(G). BG, NINC,Kq(G) is a graph with vertex set V(G) ∪ E(G) and two vertices are adjacent if and only if they correspond to two adjacent vertices of G or to a vertex and an edge not incident to it in G. For simplicity, denote this graph by BG1(G), Boolean graph of G-first kind. In this paper, partitions of edges of BG1(G) are studied.