A Steiner general position problem in graph theory
From MaRDI portal
Publication:2245772
DOI10.1007/s40314-021-01619-yzbMath1476.05043arXiv2105.08391OpenAlexW3195797667MaRDI QIDQ2245772
Dorota Kuziak, Sandi Klavžar, Iztok Peterin, Ismael González Yero
Publication date: 15 November 2021
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.08391
Steiner distancejoin of graphslexicographic product of graphsSteiner general position numberSteiner general position set
Related Items (4)
The general position achievement game played on graphs ⋮ Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products ⋮ On the general position numbers of maximal outerplane graphs ⋮ The general position avoidance game and hardness of general position games
Cites Work
- Unnamed Item
- The Steiner Wiener index of a graph
- Graphs with 4-Steiner convex balls
- Convex sets in lexicographic products of graphs
- Steiner convex sets and Cartesian product
- On the extremal combinatorics of the Hamming space
- Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence
- On general position sets in Cartesian products
- The general position problem on Kneser graphs and on some graph operations
- The general position number of Cartesian products involving a factor with small diameter
- The general position problem and strong resolving graphs
- Characterization of general position sets and its applications to cographs and bipartite graphs
- Steiner distance and convexity in graphs
- The general position number of integer lattices
- n-ary transit functions in graphs
- The Graph Theory General Position Problem on Some Interconnection Networks
- Steiner Trees and Convex Geometries
- Steiner distance in graphs
- Steiner Distance in Product Networks
- A GENERAL POSITION PROBLEM IN GRAPH THEORY
- Characterization of classes of graphs with large general position number
- On the general position problem on Kneser graphs
- On the General Position Number of Complementary Prisms
- THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES
- General d-position sets
This page was built for publication: A Steiner general position problem in graph theory