GENERAL POSITION PROBLEM OF HEXAGONAL DERIVED NETWORKS

For a graph G, the general position problem aims to obtain a general position set S of maximum number of vertices in G, in which no three vertices lie on a same geodesic in G. Such a general position set is referred to as a gp-set of G. The gp-number of G, gp(G) denotes the cardinality of a gp-set S in G. In this paper, we solve the general position problem of hexagonal derived networks such as hexagonal, honeycomb, silicate and oxide networks and compute their general position numbers i.e., gp(G).