The forcing Steiner number of a graph

DOI10.7151/dmgt.1536zbMath1284.05085OpenAlexW2074696852MaRDI QIDQ3171424

No author found.

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

zbMATH Keywords

geodetic numberSteiner numberforcing geodetic numberforcing Steiner number

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (9)

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

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