article · Pacific Journal of Mathematics · 1983

Regular embeddings of a graph

Cited by 24Open access

Abstract

In this paper we study embeddings of a graph G in Euclidean space R" that are 'regular' in the following sense: given any two distinct vertices u and v of G, the distance between the corresponding points in R" equals a if u and v are adjacent, and equals otherwise. It is shown that for any given value of s -( 2 -a 2 )/ 2 9 the minimum dimension of a Euclidean space in which G is regularly embeddable is determined by the characteristic polynomials of G and (7.

Cite this paper

APA 7

Maehara, H. (1983). Regular embeddings of a graph. Pacific Journal of Mathematics, 107(2), 393–402. https://doi.org/10.2140/pjm.1983.107.393

MLA 9

Maehara, Hiroshi. “Regular embeddings of a graph.” Pacific Journal of Mathematics, vol. 107, no. 2, 1983, pp. 393–402, https://doi.org/10.2140/pjm.1983.107.393.

Chicago

Maehara, Hiroshi. 1983. “Regular embeddings of a graph.” Pacific Journal of Mathematics 107 (2): 393–402. https://doi.org/10.2140/pjm.1983.107.393.

Harvard

Maehara, H. (1983) ‘Regular embeddings of a graph’, Pacific Journal of Mathematics, 107(2), pp. 393–402. Available at: https://doi.org/10.2140/pjm.1983.107.393.

BibTeX

@article{maehara1983regular,
  title = {{Regular embeddings of a graph}},
  author = {Maehara, Hiroshi},
  journal = {Pacific Journal of Mathematics},
  volume = {107},
  number = {2},
  pages = {393--402},
  year = {1983},
  doi = {10.2140/pjm.1983.107.393}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.