A dendroid is a connected semigraph without a strong cycle. In this paper, we obtain the various results on the enumeration of the non-isomorphic dendroids containing two edges and the dendroids with three edges.

Periodical:

Bulletin of Mathematical Sciences and Applications (Volume 18)

Pages:

40-49

Citation:

P. R. Hampiholi and J. P. Kitturkar, "On Enumeration of some Non-Isomorphic Dendroids", Bulletin of Mathematical Sciences and Applications, Vol. 18, pp. 40-49, 2017

Online since:

May 2017

Authors:

Keywords:

Distribution:

Open Access

This work is licensed under a

Creative Commons Attribution 4.0 International License

References:

[1] F. Harary, Graph theory, Narosa Publishing House, New Delhi, (1988).

[2] E. Sampathkumar, Semigraphs and their application, Technical Report [DST/MS/022/94] Department of Science and Technology, Govt. of India, August, (1999).

[3] 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.

[4] S.S. Kamath, R.S. Bhat, Domination in semigraphs, Electronic Notes in Discrete Mathematics. 15 (2003) 106-111.

DOI: 10.1016/s1571-0653(04)00548-7[5] D.K. Thakkar, A.A. Prajapati, Upper vertex covering number and well covered semigraphs, International Journal of Mathematics and Soft Computing. 6(2) (2016) 97-104.

[6] R. Sundareswaran, V. Swaminathan, (m, e)-domination in semigraphs, Electronic Notes in Discrete Mathematics. 33 (2009) 75-80.

DOI: 10.1016/j.endm.2009.03.011[7] D. Narsingh , Graph theory with applications to engineering and computer science, New Delhi, Prentice Hall of India Private Limited, (2000).

[8] A.T. Balaban, F. Harary, Chemical graphs-V enumeration and proposed nomenclature of benzenoid cata-condensed polycyclic aromatic hydrocarbons, Tetrahedron. 24(6) (1968) 2505-2516.

DOI: 10.1016/s0040-4020(01)82523-0[9] N.L. Prasanna, Applications of graph labeling in communication networks, Orient. J. Comp. Sci. and Technol. 7(1) (2014).

[10] S.J. Bharathi et al., Bipartite semigraph structure in DNA splicing system, International Journal of Computer Application. 2(6) (2012) 56-62.

[11] K. Thiagarajan, J. Padmashree, S.J. Bharathi, Evolutively finite words on semigraph folding, 3rd International Conference on Applied Mathematics and Pharmaceutical Sciences, 2013, pp.324-329.

[12] S.J. Bharathi, S. Sinthanai Selvi, Parikh representation for splicing system, in: Proceedings of the International Conference on Applied Mathematics and Theoretical Computer Science, 2013, pp.150-153.

[13] K. Kayathri, S. Pethanachi Selvam, Edge complete (p, 2) semigraphs, Ars Combinatoria. 84 (2007) 65-76.

[14] K. Kayathri, S. Pethanachi Selvam, Edge complete (p, 3) semigraphs, Acta Ciencia Indica. 33(2) (2007) 621-631.

[15] P.R. Hampiholi, J.P. Kitturkar, On enumeration of some semigraph, British Journal of Mathematics and Computer Science. 14(2) (2016) 1-14.

DOI: 10.9734/bjmcs/2016/23440[16] B.Y. Bam, N.S. Bhave, On some problems of graph theory in semigraphs, Ph. D Thesis, University of Pune.

[17] S.K. Nath, Some aspects of semigraphs, Ph. D Thesis, Gauhati University, (2013).