Open AccessDistance Based Topological Indices And Regular Graphs
Author(s) -
PuruchothamaNayakiM et. al.
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.v12i3.2147
Subject(s) - symmetric graph , line graph , mathematics , distance regular graph , combinatorics , regular graph , discrete mathematics , voltage graph , cubic graph , graph , block graph , 1 planar graph
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.