Abstract
Following Erdös, Harary, and Tutte, the euclidean dimension of a graphG is the minimumn such thatG can be embedded in euclideann-spaceR n so that each edge ofG has length 1. We present constructive proofs which give the euclidean dimension of a wheel and of a complete tripartite graph. We also define the generalized wheelW m,n as the join\(\bar K_m + C_n \) and determine the euclidean dimension of all generalized wheels.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Erdös, P.: On sets of distances ofn points in Euclidean space. Publ. Math. Inst. Hungar. Acad. Sci.5, 165–169 (1960)
Erdös, P., Harary, F., Tutte, W.T.: On the dimension of a graph. Mathematika12, 118–122 (1965)
Harary, F.: Graph Theory. Reading: Addison-Wesley 1969
Harary, F., Melter, R.: The graphs with no equilateral triangles. Gaz. Mat., Bucur.3, 182–183 (1982)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Buckley, F., Harary, F. On the euclidean dimension of a wheel. Graphs and Combinatorics 4, 23–30 (1988). https://doi.org/10.1007/BF01864150
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01864150