Steiner distance and convexity in graphs

DOI10.1016/j.ejc.2007.03.007zbMath1142.05021OpenAlexW2080134189MaRDI QIDQ2426451

Yanyan Li

Publication date: 22 April 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/xmlui/handle/11441/34681

zbMATH Keywords

treeconvex hullSteiner tree

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Related Items (16)

The Steiner Wiener index of a graph ⋮ Steiner 4-diameter, maximum degree and size of a graph ⋮ Inverse problem on the Steiner Wiener index ⋮ Computing simple-path convex hulls in hypergraphs ⋮ Unnamed Item ⋮ On Steiner degree distance of trees ⋮ Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs ⋮ Steiner convex sets and Cartesian product ⋮ A Steiner general position problem in graph theory ⋮ Toll convexity ⋮ Algorithmic aspects of Steiner convexity and enumeration of Steiner trees ⋮ Steiner diameter, maximum degree and size of a graph ⋮ Nordhaus-Gaddum Type results for the Harary index of graphs ⋮ Unnamed Item ⋮ Convex and quasiconvex functions in metric graphs ⋮ Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner tree problem
• Steiner distance stable graphs
• Rebuilding convex sets in graphs
• Steiner trees, connected domination and strongly chordal graphs
• Convexity in Graphs and Hypergraphs
• Geodetic connectivity of graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Steiner distance in graphs
• Graph Classes: A Survey
• Convexity and HHD-Free Graphs
• Steiner Minimal Trees
• Steiner's problem in graphs and its implications

This page was built for publication: Steiner distance and convexity in graphs