Semigraphs and Goldbach conjecture

Abstract

It is interesting to learn pure mathematics through graphs as graphs makes the study simple and easier to understand. We have the proof of Goldbach conjecture using graphs and hypergraphs.[1,2]. The author is motivated to study the proof of the conjecture using semigraphs. In this paper, using semigraphs, we discuss the Goldbach statement A number which is both even and not less than 2 can be written as a sum of 2 numbers which are not composites and we also show that every composite number can be expressed as sum of 3 or more primes.