Graphs and Combinatorics

, Volume 9, Issue 2–4, pp 315–323 | Cite as

On minimal embedding of two graphs as center and periphery

  • Weizhen Gu
Graphs and Combinatoric


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.


Short Path Connected Graph Disjoint Subset Center Vertex Minimal Graph 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bielak, H., Syslo, M.M.: Peripheral vertices in graphs. Stud. Sci. Math. Hung.18, 269–275 (1983)MATHMathSciNetGoogle Scholar
  2. 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–84Google Scholar
  3. 3.
    Gu, W.: Exterior vertices in graphs and realization of plurality preference diagraphs. Dissertation, Louisiana State University, 1990Google Scholar
  4. 4.
    Hedetniemi, S.M., Hedetniemi, S.T., Slater, P.J.: Centers and medians of Cn-trees. Util. Math.21, 225–234(1982).MathSciNetGoogle Scholar
  5. 5.
    Ore, O.: Diameters in graphs. J. Com. Theory5, 75–81 (1968)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Tian, S.: On graphs with prescribed center and periphery, to appear in J. Comb. Math. Comb. Comput.Google Scholar

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Weizhen Gu
    • 1
  1. 1.Department of MathematicsSouthwest Texas State UniversitySan MarcosUSA

Personalised recommendations