Distance Based Topological Indices And Regular Graphs

Main Article Content

PuruchothamaNayakiM et. al.

Abstract

In this article, we are using the regular graph of even number of vertices and computing the distance balanced graphs. First we take a graph for satisfying regular definition and then we compute the Mostar index of that particular graph. If the Mostar index of that particular graph is zero, then the graph is said to be a distance balanced graph. So we discuss first distance balanced graph. Suppose if we delete one edge in that particular graph, that is non-regular graph, we can verify the balanced graph is whether distance balanced graph or not. We discuss and compute the Mostar index of certain regular and non-regular graphs are balanced distance or not. Finally we see few theorems are related in this topic. So in this paper, we study some distance based topological indices for regular graphs and also cubic graphs.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
et. al., P. (2021). Distance Based Topological Indices And Regular Graphs. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12(3), 5191–5196. Retrieved from https://www.turcomat.org/index.php/turkbilmat/article/view/2147
Section
Research Articles