EUVIMEDEUVIMED entdecken
Open Access · CC BY-SA 4.0

Square Distance in Graphs

V. Thamarai Selvi, Pandian Vaidhyanathan

International Journal of Information Technology, Research and Applications · 2023

DOI: 10.59461/ijitra.v2i3.65 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Information Technology, Research and Applications, 2023. Verfasst von V. Thamarai Selvi und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Selvi, V. T., & Vaidhyanathan, P. (2023). Square Distance in Graphs. International Journal of Information Technology, Research and Applications. https://doi.org/10.59461/ijitra.v2i3.65

Vancouver

Selvi VT, Vaidhyanathan P. Square Distance in Graphs. International Journal of Information Technology, Research and Applications. 2023. doi:10.59461/ijitra.v2i3.65

BibTeX
@article{Selvi2023,
  author = {Selvi, V. Thamarai and Vaidhyanathan, Pandian},
  title = {Square Distance in Graphs},
  journal = {International Journal of Information Technology, Research and Applications},
  year = {2023},
  doi = {10.59461/ijitra.v2i3.65}
}
Kostenlos starten →