The Steiner number of a graph

DOI10.1016/S0012-365X(00)00456-8MaRDI QIDQ5957746zbMATH OpenOpenAlexFDO

Authors Gary Chartrand, Ping Zhang

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)

Review text

Let \(s(G)\) and \(g(G)\) be the Steiner number and geodetic number of a connected graph \(G\), respectively. Connected graphs of order \(n\) with Steiner number \(n\), \(n-1\), or 2 are characterized. Furthermore, for positive integers \(r,d\), and \(s\geq 2\) with \(r\leq d\leq 2r\), the authors present connected graphs of radius \(r\), diameter \(d\), and Steiner number \(s\). In addition, the authors show that every Steiner set in a connected graph \(G\) is also a geodetic set and thus, \(g(G)\leq s(G)\).

Recommendations

• The total Steiner number of a graph
• Steiner Numbers in Graphs
• The vertex Steiner number of a graph
• The edge Steiner number of a graph
• The edge Steiner number of a graph
• The total edge Steiner number of a graph
• The Steiner diameter of a graph
• scientific article; zbMATH DE number 4010182
• scientific article; zbMATH DE number 3871417
• The forcing Steiner number of a graph

Cited in

(29)

• 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
• A note on the geodetic number and the Steiner number of AT-free 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
• On the Steiner Radial Number of Graphs
• Some Steiner concepts on lexicographic products of graphs
• The lower and upper forcing geodetic numbers of complete n-partite graphs, n-dimensional meshes and tori
• EXTREME STEINER GRAPHS
• Steiner Numbers in Graphs
• A note on 3-Steiner intervals and betweenness
• Thek-Steiner Ratio in Graphs
• The total Steiner number of a graph
• On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs
• On the complement connected Steiner number of a graph
• The vertex Steiner number of a graph
• The upper restrained Steiner number of a graph
• scientific article; zbMATH DE number 7090175 (Why is no real title available?)
• Edge geodetic number of a graph
• Some results on Steiner decomposition number of graphs
• The edge Steiner number of a graph
• Graphs with large Steiner number
• Strong geodetic problem in grid-like architectures
• Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957746)