Abstract
By an f-graph we mean a graph having no vertex of degree greater than f. Let U(n,f) denote the graph whose vertex set is the set of unlabeled f-graphs of order n and such that the vertex corresponding to the graph G is adjacent to the vertex corresponding to the graph H if and only if H is obtainable from G by either the insertion or the deletion of a single edge. The distance between two graphs G and H of order n is defined as the least number of insertions and deletions of edges in G needed to obtain H. This is also the distance between two vertices in U(n,f). For simplicity, we also refer to the vertices in U(n,f) as the graphs in U(n,f). The graphs in U(n,f) are naturally grouped and ordered in levels by their number of edges. The distance nf/2 from the empty graph to an f-graph having a maximum number of edges is called the height of U(n,f). For f =2 and for f≥(n-1)/2, the diameter of U(n,f) is equal to the height. However, there are values of the parameters where the diameter exceeds the height. We present what is known about the following two problems: (1) What is the diameter of U(n,f) when 3≥f<(n-1)/2? (2) For fixed f, what is the least value of n such that the diameter of U(n,f) exceeds the height of U(n,f)?
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K.T. Balińska, F. Buckley, M.L. Gargano and L.V. Quintas, The diameter of a graph whose vertices are graphs, CSIS Pace University Technical Report Series, Report No. 89 (1995).
K.T. Balińska and L.V. Quintas, The random f-graph process, in: Quo Vadis, Graph Theory, Ann. Discrete Math. 55 (1992) 333–340.
K.T. Balińska and L.V. Quintas, A diameter problem and some midsize graph problems, in: 1995 Prague Midsummer Combinatorial Workshop, ed. M. Klazar, KAM Series 95-309, Department of Applied Mathematics, Charles University, Prague (1995) pp. 6–10.
M. Behzad, G. Chartrand and L. Lesniak-Foster, Graphs and Digraphs (Wadsworth International Group, Belmont, CA, 1979).
B. Bollobás, Extremal Graph Theory, London Math. Soc. Monographs, Vol. 11, eds. P.M. Cohn and G.E.H. Reuter (Academic Press, London, 1978).
B. Bollobás, Random Graphs (Academic Press, New York, 1985).
M. Johnson, Relating metrics, lines and variables defined on graphs to problems in medicinal chemistry, in: Proceedings of the Fifth International Conference on Graph Theory, eds. Y. Alavi, G. Chartrand, L. Lesniak and C. Wall (Wiley, New York, 1985) pp. 457–470.
M. Johnson, An ordering of some metrics defined on the space of graphs, Czechoslovak Math. J. 37(112) (1987) 75–85.
F. Kárteszi, Piani finiti ciclici come risoluzioni di un certo problema di minimo, Boll. Un. Mat. Ital. (3) 15 (1960) 522–528.
M. Šabo, On a maximal distance between graphs, Czechoslovak Math. J. 41(116) (1991) 265–268.
G. Wegner, A smallest graph of girth 5 and valency 5, J. Combin. Theory Ser. B 14 (1973) 205–208.
B. Zelinka, Edge distance between isomorphism classes of graphs, Cas. Pest. Mat. 112 (1987) 233–237.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Balińska, K.T., Brightwell, G.R. & Quintas, L.V. Graphs whose vertices are graphs with bounded degree: Distance problems. Journal of Mathematical Chemistry 24, 109–121 (1998). https://doi.org/10.1023/A:1019114501579
Issue Date:
DOI: https://doi.org/10.1023/A:1019114501579