This work is licensed under a
Creative Commons Attribution 4.0 International License
 B.Y. Bam, N.S. Bhave, On Some problems of Graph Theory in Semigraphs, Ph. D Thesis, University of Pune.
 C. Berge, Graphs and hypergraphs, North-Holland, London, (1973).
 C.M. Deshpande, Y.S. Gaidhani, About adjacency matrix of semigraphs, International Journal of Applied Physics and Mathematics. 2(4) (2012).DOI: https://doi.org/10.7763/ijapm.2012.v2.103
 C.M. Deshpande, Y.S. Gaidhani, B.P. Athawale, Incidence matrix of a Semigraph, British Journal of Mathematics and Computer Science. 9(1) (2015) 12-20..DOI: https://doi.org/10.9734/bjmcs/2015/17851
 D.B. West, Introduction to graph theory, Prentice-Hall of India, New Delhi, (1999).
 E. Sampatkumar, Semigraphs and their applications, Technical Report [DST/MS/022/94], Department of Science & Technology, Govt. of India, August, (1999).
 F. Harary, Graph theory, Addison-Wesley, Reading MA, (1969).
 F. Harary, G.W. Wilcox, Boolean operations on graphs, Math. Scand. 20 (1967) 41-52.DOI: https://doi.org/10.7146/math.scand.a-10817
 F. Harary, On the group of composition of two graphs, Duke Math. J. 26 (1959) 29-34.
 G. Sabidussi, The composition of graphs, Duke Math. J. 26 (1959) 693-696.DOI: https://doi.org/10.1215/s0012-7094-59-02667-5
 G. Sabidussi, The lexicographic product of graphs, Duke Math. J. 28 (1961) 573-578.DOI: https://doi.org/10.1215/s0012-7094-61-02857-5
 K. Thiagarajan, J. Padmashree, S. Jeyabharathi, Evolutively finite words on semigraph folding, 3rd International Conference on Applied Mathematics and Pharmaceutical Sciences (ICAMPS'2013) April 29-30, Singapore, (2013).
 M. Behzad, G. Chartrand, L. Lesniak-Foster, Graphs and Digraph Wadsworth International Group Belmont, (1979).
 N. Deo, Graph theory with applications to engineering and computer science, Prentice Hall of India Private Ltd.
 P.R. Hampiholi, J.P. Kitturkar, Partial edge Incidence matrix of semigraph over GF(22), International Journal of Engineering Research and Technology. 3(9) (2014).
 P.R. Hampiholi, J.P. Kitturkar, Strong circuit matrix and strong path matrix of a semigraph, Annals of Pure and Applied Mathematics. 10(2) (2015) 247-254.
 P.M. Weichsel, The Kronecker product of graphs, Proc. Amer. Math. Soc. 13 (1963) 47-52.
 P. Das, Surajit Kr. Nath, Factorization in semigraphs, International Journal of Mathematical Sciences and Engineering Applications. 5(VI) (2011).
 P. Das, Surajit Kr. Nath, The genus of semigraphs, International Journal of Mathematical Sciences and Engineering Applications. 5(V) (2011).
 S. Gomathi, R. Sundareswaran, V. Swaminathan, (m, e)-domination in semigraphs, Electronic Notes in Discrete Mathematics. 33 (2009) 75-80.DOI: https://doi.org/10.1016/j.endm.2009.03.011
 S.S. Kamath, R.S. Bhat, Domination in semigraphs, Electronic Notes in Discrete Mathematics. 15 (2003) 106-111.DOI: https://doi.org/10.1016/s1571-0653(04)00548-7
 S.S. Kamath, S.R. Hebbar, Strong and weak domination, full sets and domination balance in semigraph, Electronic Notes in Discrete Mathematics and Computer Science. 9(1) (2015) 12-20.DOI: https://doi.org/10.1016/s1571-0653(04)00549-9
 Y.B. Venkatakrishnan, V. Swaminathan, Bipartite theory of semigraphs, WSEAS Transactions on Mathematics. 11(1) (2012) 1-9.
 Y.B. Venkatakrishnan, V. Swaminathan, Hyper domination in bipartite semigraphs, WSEAS Transactions on Mathematics. 10(11) (2012).