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.
Similar content being viewed by others
References
Bielak, H., Syslo, M.M.: Peripheral vertices in graphs. Stud. Sci. Math. Hung.18, 269–275 (1983)
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
Gu, W.: Exterior vertices in graphs and realization of plurality preference diagraphs. Dissertation, Louisiana State University, 1990
Hedetniemi, S.M., Hedetniemi, S.T., Slater, P.J.: Centers and medians of Cn-trees. Util. Math.21, 225–234(1982).
Ore, O.: Diameters in graphs. J. Com. Theory5, 75–81 (1968)
Tian, S.: On graphs with prescribed center and periphery, to appear in J. Comb. Math. Comb. Comput.
Author information
Authors and Affiliations
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02988319