The Edge Steiner Number of a Graph
Bulletin of the Malaysian Mathematical Society, Tome 35 (2012) no. 1
Cet article a éte moissonné depuis la source Bulletin of the Malaysian Mathematical Society website
The concepts of edge Steiner set and edge Steiner number of a graph are investigated in this study. A necessary and sufficient condition for a graph $G$ to satisfy ${\rm st}_e(G) = \vert V(G) \vert - 1$, where ${\rm st}_e(G)$ denotes the edge Steiner number of $G$, is obtained. Edge Steiner sets in the joins of graphs are also studied and the Steiner numbers of these graphs are determined.
Classification :
05C12.
@article{BMMS_2012_35_1_a4,
author = {Michael B. Frondoza and Sergio R. Canoy and Jr.},
title = {The {Edge} {Steiner} {Number} of a {Graph}},
journal = {Bulletin of the Malaysian Mathematical Society},
year = {2012},
volume = {35},
number = {1},
url = {http://geodesic.mathdoc.fr/item/BMMS_2012_35_1_a4/}
}
Michael B. Frondoza; Sergio R. Canoy; Jr. The Edge Steiner Number of a Graph. Bulletin of the Malaysian Mathematical Society, Tome 35 (2012) no. 1. http://geodesic.mathdoc.fr/item/BMMS_2012_35_1_a4/