The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Some remarks on the Steiner triple systems associated with Steiner quadruple systems”

The forcing steiner number of a graph

A.P. Santhakumaran, J. John (2011)

Discussiones Mathematicae Graph Theory

Similarity:

For a connected graph G = (V,E), a set W ⊆ V is called a Steiner set of G if every vertex of G is contained in a Steiner W-tree of G. The Steiner number s(G) of G is the minimum cardinality of its Steiner sets and any Steiner set of cardinality s(G) is a minimum Steiner set of G. For a minimum Steiner set W of G, a subset T ⊆ W is called a forcing subset for W if W is the unique minimum Steiner set containing T. A forcing subset for W of minimum cardinality is a minimum forcing subset...

On the forcing geodetic and forcing steiner numbers of a graph

A.P. Santhakumaran, J. John (2011)

Discussiones Mathematicae Graph Theory

Similarity:

For a connected graph G = (V,E), a set W ⊆ V is called a Steiner set of G if every vertex of G is contained in a Steiner W-tree of G. The Steiner number s(G) of G is the minimum cardinality of its Steiner sets and any Steiner set of cardinality s(G) is a minimum Steiner set of G. For a minimum Steiner set W of G, a subset T ⊆ W is called a forcing subset for W if W is the unique minimum Steiner set containing T. A forcing subset for W of minimum cardinality is a minimum forcing subset...