The forcing Steiner number of a graph

DOI10.7151/DMGT.1536zbMATH Open1284.05085OpenAlexW2074696852MaRDI QIDQ3171424FDOQ3171424

Authors:

Publication date: 5 October 2011

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cc8b985095fdeb22fa0f0ab04be248f95e8b7bc0

Recommendations

• The upper forcing Steiner number of a graph
• On the forcing geodetic and forcing steiner numbers of a graph
• scientific article; zbMATH DE number 1439409
• Steiner Numbers in Graphs
• The total Steiner number of a graph

zbMATH Keywords

geodetic numberforcing geodetic numberSteiner numberforcing Steiner number

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cited In (13)

• The forcing edge covering number of a graph
• The total Steiner number of a graph
• Determination of the size of defining set for Steiner triple systems
• On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs
• The upper restrained Steiner number of a graph
• The Steiner number of a graph
• Graphs with large Steiner number
• The vertex Steiner number of a graph
• The upper forcing Steiner number of a graph
• On the complement connected Steiner number of a graph
• The forcing nonsplit domination number of a graph
• On the forcing geodetic and forcing steiner numbers of a graph
• THE FORCING HOP DOMINATION NUMBER OF A GRAPH

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

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