Bigraph in Graph Theory

Abstract

In this paper we study  bigraph in graph theory and discussed properties bigraph of some type graph, we study odd complete graph and even complete graph has bigraph such that when partition graph into two part  ,  , if even complete graph such  is odd complete graph after partition and  is not complete graph, either if odd complete graph such  is even complete graph after partition and  is not complete graph, we study regular graph for me bigraph too we get after partition  either odd  complete graph or even complete graph, will we discuss the status every  bigraph is disconnected graph, also are looking at rest graphics achieve their properties B- bigraph  for example we take Euler graph, square graph, Hamiltonian cycle graph , Hamiltonian path graph, This is the convention we use when trying to represent a bigroup by a graph. The vertices corresponds to the elements of the group, hence the order of the group  corresponds to the number of vertices in the graph.