General Position Problem of Middle, Splitting and Shadow Graph of Path, Cycle and Star

Main Article Content

R. Prabha, Sabreen Nazia G.

Abstract

For a given graph G, the general position problem is to find the general position number of G which is the maximum number of vertices of G such that no three vertices lie on a common geodesic and is denoted by . In this paper, the general position number for Middle, Splitting and Shadow graph of path, cycle and star are computed.

Article Details

Section
Articles