The Steiner number of a graph

DOI10.1016/S0012-365X(00)00456-8zbMATH Open0988.05034OpenAlexW1970115538MaRDI QIDQ5957746FDOQ5957746

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

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

zbMATH Keywords

connected graphsgeodetic numberSteiner numberSteiner setSteiner distamce

Mathematics Subject Classification ID

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

Cited In (28)

• Title not available (Why is that?)
• Geodetic sets and Steiner sets in graphs
• Edge geodetic number of a graph
• The total Steiner number of a graph
• A note on 3-Steiner intervals and betweenness
• The edge Steiner number of a graph
• The lower and upper forcing geodetic numbers of block--cactus graphs
• On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs
• The upper restrained Steiner number of a graph
• EXTREME STEINER GRAPHS
• Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
• Steiner intervals, geodesic intervals, and betweenness
• Strong geodetic problem in grid-like architectures
• Some results on Steiner decomposition number of graphs
• The vertex steiner number of a graph
• Comment on ``The Steiner number of a graph by G. Chartrand and P. Zhang [Discrete Mathematics 242 (2002) 41--54]
• Title not available (Why is that?)
• Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals
• Graphs with large Steiner number
• Toll number of the Cartesian and the lexicographic product 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
• On steiner sets and polynomials of wheels and helm graphs
• Steiner Numbers in Graphs
• On the Steiner, geodetic and hull numbers of graphs
• Thek-Steiner Ratio in Graphs
• Toll number of the strong product of graphs
• On the Steiner Radial Number of 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)