Steiner distance and convexity in graphs
From MaRDI portal
Publication:2426451
Recommendations
- Steiner distance in graphs
- scientific article; zbMATH DE number 1355283
- scientific article; zbMATH DE number 3904638
- scientific article; zbMATH DE number 553909
- scientific article; zbMATH DE number 975321
- Convexity and the Steiner tree problem
- scientific article; zbMATH DE number 687700
- Steiner distance stable graphs
- Steiner trees and convex geometries
- Bounds on the Steiner radius of a graph
Cites work
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Convexity and HHD-Free Graphs
- Convexity in Graphs and Hypergraphs
- Geodetic connectivity of graphs
- Graph Classes: A Survey
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- scientific article; zbMATH DE number 687700 (Why is no real title available?)
- scientific article; zbMATH DE number 3384060 (Why is no real title available?)
- Rebuilding convex sets in graphs
- Steiner distance in graphs
- Steiner distance stable graphs
- Steiner Minimal Trees
- Steiner trees, connected domination and strongly chordal graphs
- Steiner's problem in graphs and its implications
- The Steiner tree problem
Cited in
(31)- Local Steiner convexity
- Convex extendable trees
- Inverse problem on the Steiner Wiener index
- On Steiner degree distance of trees
- Steiner convex sets and Cartesian product
- Computing simple-path convex hulls in hypergraphs
- Steiner diameter, maximum degree and size of a graph
- Convex and quasiconvex functions in metric graphs
- A note on the geodetic number and the Steiner number of AT-free graphs
- A Steiner general position problem in graph theory
- Toll convexity
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
- The Steiner Wiener index of a graph
- Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals
- Steiner trees and convex geometries
- Convexity and HHD-Free Graphs
- scientific article; zbMATH DE number 687700 (Why is no real title available?)
- Nordhaus-Gaddum type results for the Harary index of graphs
- Steiner Harary index
- Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
- MEAN STEINER DISTANCE OF VICSEK NETWORKS
- Steiner 4-diameter, maximum degree and size of a graph
- Steiner Wiener index of graph products
- Graphs with 4-Steiner convex balls
- Weakly toll convexity and proper interval graphs
- Characterizations of graph classes via convex geometries: a survey
- Quasiconvex functions on regular trees
- The Steiner Gutman index of trees
- Complexity and structural results for the hull and convexity numbers in cycle convexity for graph products
- The spectral radius of Steiner distance hypermatrices of graphs
- On the Steiner Szeged index: a counterexample and partial validation of Ghorbani's conjecture
This page was built for publication: Steiner distance and convexity in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2426451)
