Skip to main content
Log in

On minimal embedding of two graphs as center and periphery

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

For any graphs Gi and G2, and an integer d (2 ≤ d ≤ r(G2)), define β(G1,G2) (or β(G1, G2; d)) to be the minimum number of vertices of the graph H which contains G1 as its center and G2 as its periphery (and dia(H) = d, respectively). In this paper, the values of β(G1,G2) and the upper bounds for β(G1, G2; d) are obtained when G2 is not 3-self-centered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bielak, H., Syslo, M.M.: Peripheral vertices in graphs. Stud. Sci. Math. Hung.18, 269–275 (1983)

    MATH  MathSciNet  Google Scholar 

  2. Buckley, F., Lewinter, M.: Minimal graph embeddings, eccentric vertices and the peripherian. Proceedings of the Fifth Caribbean Conference on Combinatorics and Computing, University of the West Indies, Barbados, 1988, pp. 72–84

    Google Scholar 

  3. Gu, W.: Exterior vertices in graphs and realization of plurality preference diagraphs. Dissertation, Louisiana State University, 1990

  4. Hedetniemi, S.M., Hedetniemi, S.T., Slater, P.J.: Centers and medians of Cn-trees. Util. Math.21, 225–234(1982).

    MathSciNet  Google Scholar 

  5. Ore, O.: Diameters in graphs. J. Com. Theory5, 75–81 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  6. Tian, S.: On graphs with prescribed center and periphery, to appear in J. Comb. Math. Comb. Comput.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gu, W. On minimal embedding of two graphs as center and periphery. Graphs and Combinatorics 9, 315–323 (1993). https://doi.org/10.1007/BF02988319

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02988319

Keywords