Average Distance of Certain Graphs


Abstract views: 23 / PDF downloads: 21

Authors

  • Jasintha Quadras Department of Mathematics, Stella Maris College, Chennai, Tamilnadu, India
  • K. Arputha Christy Department of Mathematics, Stella Maris College, Chennai, Tamilnadu, India
  • A. Nelson Department of Mathematics, Loyola College, Chennai, Tamilnadu, India
  • S. Sarah Surya Department of Mathematics, Stella Maris College, Chennai, Tamilnadu, India

Keywords:

Wiener index, average distance, generalized prisms, uniform $n$-wheel split graph, uniform $n$-star split graph, cyclic split graph

Abstract

Mean distance or average distance is used in studying the efficiency of networks or more generally `good networks' which are often characterized by small distance. It is also used as a tool in analytic networks where the performance time is proportional to the distance between any two nodes. In this paper, we compute the Wiener index and the average distance of generalised prisms, uniform $n$-wheel split graph, uniform $n$-star split graph and cyclic split graph.

Downloads

Published

15-03-2017

How to Cite

Jasintha Quadras, K. Arputha Christy, A. Nelson, & S. Sarah Surya. (2017). Average Distance of Certain Graphs. International Journal of Mathematics And Its Applications, 5(1 - C), 371–383. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/786

Issue

Vol. 5 No. 1 - C (2017)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.