Average circular D-distance and circular D-Wiener index of K-regular graphs | Zendy

Et. al. Janagam Veeranjaneyulu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Average circular D-distance and circular D-Wiener index of K-regular graphs

Author(s) -

Et. al. Janagam Veeranjaneyulu

Publication year - 2021

Publication title -

türk bilgisayar ve matematik eğitimi dergisi

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.218

H-Index - 3

ISSN - 1309-4653

DOI - 10.17762/turcomat.v12i2.2062

Subject(s) - wiener index , mathematics , combinatorics , graph , distance matrix , topological index , index (typography) , computer science , world wide web

The circular -distance between nodes of a graph is obtained by the sum of detour -distance and -distance. The average circular -distance between the nodes of a graph is the sum of average of the detour -distance and -distances. In this paper, we deal with the average circular -distance between nodes of graph. We compute the relation between circular Wiener index and circular -Wiener index of -regular graphs. We obtained results on circular -Wiener index of some special graphs

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research