On the Topological Indices of Hexagonal Network (HX6), Complete Bi-Partite and Complete Graphs

N. K. Raut

Abstract: A graph in which any two distinct points are adjacent is called a complete graph. A complete bi-partite graph is a graph whose vertices can be partitioned into two subsets V1 and V2 such that no edge has both endpoints in the same subset and every possible edge that could connect vertices in different subsets is part of graph and is denoted by Km,n. In this paper some d2-distance degree, eccentricity; sum-degree based topological indices are studied for hexagonal network with dimension six, complete bi-partite and complete graphs.

Keywords: Complete graph, complete bi-partite graph, degree, distance-degree, eccentricity, hexagonal network, Sanskruti index, sum-degree and topological index