Square Distance in Graphs

Authors

  • V. Thamarai Selvi Department of General Foundation, Sohar University, Oman
  • Pandian Vaidhyanathan University of Technology and Applied Sciences, Shinas, Oman

DOI:

https://doi.org/10.59461/ijitra.v2i3.65

Keywords:

Detour, Centrality, cancer

Abstract

In this paper, we consider a simple connected graph   having no loops and multiple edges. The order and size of  are denoted by  and  respectively in graphs is a wide branch of graph theory having many scientific and real-life applications. There are various types of distances studied in the literature.The distance  is the length of the shortest path between the vertices  and  in  [2]. The detour distance  is the length of the longest path between the vertices  and  in  [3]. The concept of centrality widely applied in social network analysis. Degree centrality is the simplest centrality measure to compute centre. Betweenness centrality measures used for analyzed cancer network.

Downloads

Published

2023-09-07

How to Cite

V. Thamarai Selvi, & Pandian Vaidhyanathan. (2023). Square Distance in Graphs. International Journal of Information Technology, Research and Applications, 2(3), 5–11. https://doi.org/10.59461/ijitra.v2i3.65

Issue

Vol. 2 No. 3 (2023): IJITRA

Section

Special Issue

License

Copyright (c) 2023 International Journal of Information Technology, Research and Applications

Creative Commons License

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