Neighbour Degree Connectivity Indices of Graphs and Its Applications to the Octane Isomers

Ashwini Yalaniak, Supriya Butte

Abstract: The sum of neighbour degrees ?G(u) of a vertex u is defined as the sum of the degrees of all neighbour vertices of u of a graph G. In this paper, we obtained neighouhourhood version of Zagreb indices of line graph of the subdivision graph of 2D-lattice of T UC4C8[p; q] and graphene sheet.

Keywords: Neighbour, degree, neighbour degree connectivity indices, graphene sheet

How to Cite?: Ashwini Yalaniak, Supriya Butte, "Neighbour Degree Connectivity Indices of Graphs and Its Applications to the Octane Isomers", Volume 12 Issue 4, April 2023, International Journal of Science and Research (IJSR), Pages: 1892-1896, https://www.ijsr.net/getabstract.php?paperid=SR23716144709, DOI: https://dx.doi.org/10.21275/SR23716144709