The Steiner number of a graph

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

Ping Zhang, Gary Chartrand

Publication date: 24 June 2002

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

zbMATH Keywords

connected graphs; geodetic number; Steiner distamce; Steiner number; Steiner set

Mathematics Subject Classification ID

05C05: Trees

05C12: Distance in graphs

Related Items

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