Self Centeredness of Total Graphs W.R.T. D-Distance

Authors

  • M. V. Ramanjaneyulu

  • P. L. N.Varma

  • D. Reddy Babu

Received date: October 4, 2018

Accepted date: October 4, 2018

Published date: October 2, 2018

DOI:

https://doi.org/10.14419/ijet.v7i4.10.20938

Keywords:

Total graph, D-distance, self-centered graphs

Abstract

In this article using D-distance, we study the self-centeredness of total graphs. We end with some open questions.

 

 

References

  1. [1] Frank Harary (2001), Graph theory, Narosa Publishing House, New Delhi.

    [2] Ramanjaneyulu M.V, Varma P.L.N, and Reddy Babu D (2017), Self Centered total graphs w.r.t. D-distance, Proceedings of the DST-SERB sponsored National Conference Essence of mathematics and Engineering Applications, KLEF , Vaddeswaram, 22-25 (ISBN No. 9788193063880)

    [3] Reddy Babu D, Varma P.L.N. (2013)D-distance in graphs, Golden Research Thoughts, 2( 9), 53-58.

    [4] Reddy Babu D. and Varma P. L. N., (2017)D-Radius and D-diameter of some Families of graphs, Int. Jour. of Chem. Sci., 15(1), 1-9.

Downloads

How to Cite

V. Ramanjaneyulu, M., L. N.Varma, P., & Reddy Babu, D. (2018). Self Centeredness of Total Graphs W.R.T. D-Distance. International Journal of Engineering and Technology, 7(4.10), 366-370. https://doi.org/10.14419/ijet.v7i4.10.20938

Received date: October 4, 2018

Accepted date: October 4, 2018

Published date: October 2, 2018