Some Steiner concepts on lexicographic products of graphs
From MaRDI portal
Publication:2931926
DOI10.1142/S1793830914500608zbMath1303.05163MaRDI QIDQ2931926
G. Narasimha-Shenoi Prasanth, Bijo S. Anand, Iztok Peterin, Manoj Changat
Publication date: 28 November 2014
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830914500608
05C05: Trees
05C35: Extremal problems in graph theory
05C76: Graph operations (line graphs, products, etc.)
Related Items
The total Steiner number of a graph, On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs, On the \(P_3\)-hull number of some products of graphs, Helly and exchange numbers of geodesic and Steiner convexities in lexicographic product of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on 3-Steiner intervals and betweenness
- The pre-hull number and lexicographic product
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
- On a local 3-Steiner convexity
- Convex sets in lexicographic products of graphs
- Separation properties of 3-Steiner and 3-monophonic convexity in 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
- Convex sets in graphs. II: Minimal path convexity
- On triangle path convexity in graphs
- Steiner intervals in graphs
- Convexities related to path properties on graphs
- On the Steiner, geodetic and hull numbers of graphs
- The geodetic number of the lexicographic product of graphs
- Steiner centers and Steiner medians of graphs
- n-ary transit functions in graphs
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
- The Steiner number of a graph
