A Steiner general position problem in graph theory

Abstract

Let G be a graph. The Steiner distance of \(W\subseteq V(G)\) is the minimum size of a connected subgraph of G containing W. Such a subgraph is necessarily a tree called a Steiner W-tree. The set \(A\subseteq V(G)\) is a k-Steiner general position set if \(V(T_B)\cap A = B\) holds for every set \(B\subseteq A\) of cardinality k, and for every Steiner B-tree \(T_B\). The k-Steiner general position number \(\mathrm{sgp}_k(G)\) of G is the cardinality of a largest k-Steiner general position set in G. Steiner cliques are introduced and used to bound \(\mathrm{sgp}_k(G)\) from below. The k-Steiner general position number is determined for trees, cycles and joins of graphs. Lower bounds are presented for split graphs, infinite grids and lexicographic products. The lower bound for the latter product leads to an exact formula for the general position number of an arbitrary lexicographic product.