A Steiner general position problem in graph theory

From MaRDI portal
Publication:2245772

DOI10.1007/S40314-021-01619-YzbMATH Open1476.05043arXiv2105.08391OpenAlexW3195797667MaRDI QIDQ2245772FDOQ2245772


Authors: Sandi Klavžar, Dorota Kuziak, Iztok Peterin, Ismael G. Yero Edit this on Wikidata


Publication date: 15 November 2021

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Abstract: Let G be a graph. The Steiner distance of WsubseteqV(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 AsubseteqV(G) is a k-Steiner general position set if V(TB)capA=B holds for every set BsubseteqA of cardinality k, and for every Steiner B-tree TB. The k-Steiner general position number msgpk(G) of G is the cardinality of a largest k-Steiner general position set in G. Steiner cliques are introduced and used to bound msgpk(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 products leads to an exact formula for the general position number of an arbitrary lexicographic product.


Full work available at URL: https://arxiv.org/abs/2105.08391




Recommendations




Cites Work


Cited In (11)





This page was built for publication: A Steiner general position problem in graph theory

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