Steiner Distance in Graphs--A Survey
Yaping Mao

TL;DR
This survey reviews the current state of research on Steiner distance parameters in graphs, including definitions, properties, and open problems, providing a comprehensive overview for future investigations.
Contribution
It compiles and summarizes known results on Steiner distance parameters, highlighting conjectures and open problems for further research.
Findings
Summarized key results on Steiner distance and related parameters.
Identified open problems and conjectures in the field.
Provided a comprehensive overview for future research directions.
Abstract
For a connected graph of order at least and , the \emph{Steiner distance} among the vertices of is the minimum size among all connected subgraphs whose vertex sets contain . In this paper, we summarize the known results on the Steiner distance parameters, including Steiner distance, Steiner diameter, Steiner center, Steiner median, Steiner interval, Steiner distance hereditary graph, Steiner distance stable graph, average Steiner distance, and Steiner Wiener index. It also contains some conjectures and open problems for further studies.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Interconnection Networks and Systems · Graph theory and applications
