IJIRCSTJournal International Journal of Innovative Research in Computer Science and Technology I S Volume 4 Issue 1 Science & Engineering English January - February 2016 N N Y 2019 12 05 Computer Sciences Classification of Some {0,1}-Semigraphs English Y 10 12 Ibrahim GUNALTILI English Y An adjacent graph is a connected bipartite {0,1}-semigraph which contains exactly one part in which any two vertices have exactly one common neighbour. Mulder [1] observed that; (0, λ) -semigraphs are regular. Furthermore a lower bound for the degree of (0,n)-semi graphs with diameter at least four was derived by Mulder [1]. In this paper, we find all -graphs and (0,1)-graphs. Furthermore, we determined some basic properties of adjacent graphs, where, λ≥1.a English A-semigraph, bipartite graph AMS Subject Classification: 51E20 , 51A45. https://ijircst.org/abstract.php?article_id=246