On the Steiner, geodetic and hull numbers of graphs

@article{Hernando2005OnTS,
  title={On the Steiner, geodetic and hull numbers of graphs},
  author={M. Carmen Hernando and Tao Jiang and Merc{\`e} Mora and Ignacio M. Pelayo and Carlos Seara},
  journal={Discrete Mathematics},
  year={2005},
  volume={293},
  pages={139-154}
}
Given a graph G and a subset W ⊆ V (G), a Steiner W -tree is a tree of minimum order that contains all of W . Let S(W ) denote the set of all vertices in G that lie on some Steiner W -tree; we call S(W ) the Steiner interval of W . If S(W ) = V (G), then we call W a Steiner set of G. The minimum order of a Steiner set of G is called the Steiner number of G. Given two vertices u, v in G, a shortest u − v path in G is called a u − v geodesic. Let I[u, v] denote the set of all vertices in G lying… CONTINUE READING
34 Citations
19 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Boland , Representation of a finite graph by a set of intervals on the real line , Fund Comment on “ The Steiner number of a graph ”

  • M. Van de Vel
  • Discrete Math .
  • 2002

Jamison , On local convexity in graphs

  • P. L. S. Földes
  • Discrete Math .
  • 1987

Convexity in graphs and hypergraphs

  • M. Farber, R. E. Jamison
  • SIAM J. Alg. Disc. Math., 7 (3)
  • 1986
2 Excerpts

Jamison , Convexity in graphs and hypergraphs

  • R. E. M. Farber
  • SIAM J . Alg . Disc . Math .
  • 1986

Similar Papers

Loading similar papers…