General d-position sets
Keywords:General d-position sets, dissociation sets, strong resolving graphs, computational complexity, infinite graphs
The general d-position number gpd(G) of a graph G is the cardinality of a largest set S for which no three distinct vertices from S lie on a common geodesic of length at most d. This new graph parameter generalizes the well studied general position number. We first give some results concerning the monotonic behavior of gpd(G) with respect to the suitable values of d. We show that the decision problem concerning finding gpd(G) is NP-complete for any value of d. The value of gpd(G) when G is a path or a cycle is computed and a structural characterization of general d-position sets is shown. Moreover, we present some relationships with other topics including strong resolving graphs and dissociation sets. We finish our exposition by proving that gpd(G) is infinite whenever G is an infinite graph and d is a finite integer.
Articles in this journal are published under Creative Commons Attribution 4.0 International License