Steiner convex sets and Cartesian product
From MaRDI portal
Publication:1746705
DOI10.1007/s40840-016-0312-8zbMath1390.05055OpenAlexW2274492690MaRDI QIDQ1746705
Publication date: 25 April 2018
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-016-0312-8
Paths and cycles (05C38) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Related Items
The average Steiner 3-eccentricity of block graphs, On the average Steiner 3-eccentricity of trees, The Steiner \(k\)-eccentricity on trees, A Steiner general position problem in graph theory, Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with 4-Steiner convex balls
- On a local 3-Steiner convexity
- Convex sets in lexicographic products of graphs
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
- Local Steiner convexity
- Steiner intervals, geodesic intervals, and betweenness
- On 3-Steiner simplicial orderings
- Steiner intervals in graphs
- Convexities related to path properties on graphs
- Convex sets under some graph operations
- Toll convexity
- Intervals and convex sets in strong product of graphs
- Steiner distance and convexity in graphs
- Geodesic Convexity in Graphs
- Steiner Trees and Convex Geometries
- Steiner Minimal Trees
