Lower General Position Sets in Graphs

MaRDI QIDQ6510609arXivFDO

Authors Gabriele Di Stefano, Sandi Klavžar, James Tuite, Ismael G. Yero

Published in arXiv

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)

Abstract: A subset $S$ of vertices of a graph $G$ is a emph{general position set} if no shortest path in $G$ contains three or more vertices of $S$. In this paper, we generalise a problem of M. Gardner to graph theory by introducing the emph{lower general position number} $g{p}^{-}(G)$ of $G$, which is the number of vertices in a smallest maximal general position set of $G$. We show that ${mgp}^{-}(G)=2$ if and only if $G$ contains a universal line and determine this number for several classes of graphs, including Kneser graphs $K(n,2)$, line graphs of complete graphs, and Cartesian and direct products of two complete graphs. We also prove several realisation results involving the lower general position number, the general position number and the geodetic number, and compare it with the lower version of the monophonic position number. We provide a sharp upper bound on the size of graphs with given lower general position number. Finally we demonstrate that the decision version of the lower general position problem is NP-complete.

This page was built for publication: Lower General Position Sets in Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6510609)