• STATUS NEIGHBORHOOD DAKSHAYANI INDICES

Abstract

The status of a vertex u in a connected graph G is defined as the sum of the distances between u and all other vertices of G. In this study, we introduce the first, second and third or vertex status neighborhood Dakshayani indices, the first and second hyper status neighborhood Dakshayani indices of a graph and determine exact formulas for some standard graphs and friendship graphs. Also we define the first, second, third or vertex status neighborhood Dakshayani polynomials of a graph and compute exact formulas for some standard graphs and friendship graphs.