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.
Downloads
References
Harary F., Graph Theory, Addison-Wesley, Reading MA (1969).
Paul Van Dooren, Graph Theory and Applications , Université catholique de Louvain, Louvain-la-Neuve, Belgium Dublin, August 2009
R.Muthuraj Department of Mathematics PSNA CET, Dindigul. – 624 622. P.M.Sitharselvam Department of Mathematics PSNA CET, Dindigul. – 624 622. M.S.Muthuraman Department of Mathematics PSNA CET, Dindigul. – 624 622. Anti Q-Fuzzy Group and Its Lower Level Subgroups nternational Journal of Computer Applications (0975 – 8887) Volume 3 – No.3, June (2010).
W.B.Vasantha Kandasamy Florentin Smarardache, Group As Graphs,(2009).
Copyright (c) 2019 Journal of Progressive Research in Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.