À propos de cet article

Citez

[1] D. B. West, Introduction to Graph Theory, Prentice Hall of India, New Delhi, 2005. ⇒24Search in Google Scholar

[2] F. Harary, Graph Theory, Narosa Publishing House, New Delhi, 2001. ⇒24Search in Google Scholar

[3] J. K. Sebastian, J. V. Kureethara, Pendant number of graphs, Int. J. Appl. Math., IJAM31, 5 (2018) 679–689. ⇒25, 34, 3510.12732/ijam.v31i5.12Search in Google Scholar

[4] J. K. Sebastian, J. V. Kureethara, N. K. Sudev, C. Dominic, On star decomposition and star number of some graph classes, Int. J. Scien. Res. Mathe. Stati. Sci., IJSRMSS, 5, 6 (2018) 81–85. ⇒25Search in Google Scholar

[5] J. K. Sebastian, J. V. Kureethara, N. K. Sudev, C. Dominic, On the pendant number of some new graph classes, Res. Rev. Discrete Math. Structures RRDMS, 6, 1 (2019), 15–21. ⇒34, 35, 3610.37591/rrdms.v6i1.1900Search in Google Scholar

[6] J. K. Sebastian, J. V. Kureethara, N. K. Sudev, The pendant number of line graphs and total graphs, communicated. ⇒34, 35, 36Search in Google Scholar

[7] N. K. Sudev, K. A. Germina, A study on topological integer additive set-labeling of graphs, Electron. J. of Graph Theory Appl. Electronic Journal, 3, 1 (2015), 70–84. ⇒2910.5614/ejgta.2015.3.1.8Search in Google Scholar

[8] Y. N. Yeh, I. Gutman, On the sum of all distances in composite graphs, Discrete Math. Discrete, 135, 1-3 (1994), 359–365. ⇒3410.1016/0012-365X(93)E0092-ISearch in Google Scholar

[9] X. Zhang, H. Zhang, Some graphs determined by their spectra, Lin. Alg. and Its Appl. Linear, 431, 9 (2009), 1443–1454. ⇒3210.1016/j.laa.2009.05.018Search in Google Scholar

eISSN:
2066-7760
Langue:
Anglais
Périodicité:
2 fois par an
Sujets de la revue:
Computer Sciences, other