The Steiner number of a graph

DOI10.1016/S0012-365X(00)00456-8zbMath0988.05034OpenAlexW1970115538MaRDI QIDQ5957746

Ping Zhang, Gary Chartrand

Publication date: 24 June 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00456-8

zbMATH Keywords

connected graphsgeodetic numberSteiner distamceSteiner numberSteiner set

Mathematics Subject Classification ID

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

Related Items

EXTREME STEINER GRAPHS ⋮ Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs ⋮ Unnamed Item ⋮ Some Steiner concepts on lexicographic products of graphs ⋮ A note on 3-Steiner intervals and betweenness ⋮ The lower and upper forcing geodetic numbers of block--cactus graphs ⋮ Toll number of the strong product of graphs ⋮ Unnamed Item ⋮ The edge Steiner number of a graph ⋮ Edge geodetic number of a graph ⋮ Toll number of the Cartesian and the lexicographic product of graphs ⋮ On the Steiner, geodetic and hull numbers of graphs ⋮ The lower and upper forcing geodetic numbers of completen-partite graphs,n-dimensional meshes and tori ⋮ Strong geodetic problem in grid-like architectures ⋮ The vertex steiner number of a graph ⋮ The total Steiner number of a graph ⋮ The upper restrained Steiner number of a graph ⋮ On steiner sets and polynomials of wheels and helm graphs ⋮ Comment on ``The Steiner number of a graph by G. Chartrand and P. Zhang [Discrete Mathematics 242 (2002) 41--54] ⋮ Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals ⋮ Geodetic sets and Steiner sets in graphs ⋮ Steiner intervals, geodesic intervals, and betweenness ⋮ On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs

This page was built for publication: The Steiner number of a graph