Skip to main content
  • 559 Accesses

Abstract

Euclidean Distance Matrices fall into two classes: spherical and nonspherical. The first part of this chapter discusses various characterizations and several subclasses of spherical EDMs. Among the examples of spherical EDMs discussed are: regular EDMs, cell matrices, Manhattan distance matrices, Hamming distance matrices on the hypercube, distance matrices of trees and resistance distance matrices of electrical networks. The second part focuses on nonspherical EDMs and their characterization. As an interesting example of nonspherical EDMs, we discuss multispherical EDMs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. A.Y. Alfakih, A remark on the Manhattan distance matrix of a rectangular grid, 2012. arXiv/1208.5150

    Google Scholar 

  2. A.Y. Alfakih, H. Wolkowicz, Two theorems on Euclidean distance matrices and Gale transform. Linear Algebra Appl. 340, 149–154 (2002)

    Article  MathSciNet  Google Scholar 

  3. R. Balaji, R.B. Bapat, On Euclidean distance matrices. Linear Algebra Appl. 424, 108–117 (2007)

    Article  MathSciNet  Google Scholar 

  4. R.B. Bapat, Graphs and Matrices (Springer, London, 2010)

    Book  Google Scholar 

  5. P.G. Doyle, J.L. Snell, Random Walks and Electric Networks (Mathematical Association of America, Washington, 1984)

    Google Scholar 

  6. M. Fiedler, A geometric approach to the Laplacian matrix of a graph, in Combinatorial and Graph-Theoretical Problems in Linear Algebra, ed. by R.A. Brualdi, S. Friedland, V. Klee (Springer, New York, 1993), pp. 73–98

    Chapter  Google Scholar 

  7. M. Fiedler, Moore-Penrose involutions in the classes of Laplacians and simplices. Linear Multilinear Algebra 39, 171–178 (1995)

    Article  MathSciNet  Google Scholar 

  8. J.C. Gower, Euclidean distance geometry. Math. Sci. 7, 1–14 (1982)

    MathSciNet  MATH  Google Scholar 

  9. J.C. Gower, Properties of Euclidean and non-Euclidean distance matrices. Linear Algebra Appl. 67, 81–97 (1985)

    Article  MathSciNet  Google Scholar 

  10. R.L. Graham, L. Lovász, Distance matrix polynomials of trees. Adv. Math. 29, 60–88 (1978)

    Article  MathSciNet  Google Scholar 

  11. R.L. Graham, H.O. Pollak, On the addressing problem for loop switching. Bell Syst. Tech. J. 50, 2495–2519 (1971)

    Article  MathSciNet  Google Scholar 

  12. R.L. Graham, P.M. Winkler, On isometric embeddings of graphs. Trans. Am. Math. Soc. 288, 527–536 (1985)

    Article  MathSciNet  Google Scholar 

  13. T.L. Hayden, P. Tarazaga, Distance matrices and regular figures. Linear Algebra Appl. 195, 9–16 (1993)

    Article  MathSciNet  Google Scholar 

  14. T.L. Hayden, J. Lee, J. Wells, P. Tarazaga, Block matrices and multispherical structure of distance matrices. Linear Algebra Appl. 247, 203–216 (1996)

    Article  MathSciNet  Google Scholar 

  15. A.J. Hoffman, On the polynomial of a graph. Am. Math. Mon. 70, 30–36 (1963)

    Article  Google Scholar 

  16. G. Jaklič, J. Modic, On properties of cell matrices. Appl. Math. Comput. 216, 2016–2023 (2010)

    MathSciNet  MATH  Google Scholar 

  17. H.W.E. Jung, Ueber die kleinste kugel, die eine raumliche figur einschliesst. J. Reine Angew. Math. 123, 241–257 (1901)

    MathSciNet  MATH  Google Scholar 

  18. D.J. Klein, M. Randić, Resistance distance. J. Math. Chem. 12, 81–95 (1993)

    Article  MathSciNet  Google Scholar 

  19. H. Kurata, S. Matsuura, Characterization of multispherical and block structures of Euclidean distance matrices. Linear Algebra Appl. 439, 3177–3183 (2013)

    Article  MathSciNet  Google Scholar 

  20. H. Kurata, T. Sakuma, A group majorization ordering for Euclidean distance matrices. Linear Algebra Appl. 420, 586–595 (2007)

    Article  MathSciNet  Google Scholar 

  21. H. Kurata, P. Tarazaga, Multispherical Euclidean distance matrices. Linear Algebra Appl. 433, 534–546 (2010)

    Article  MathSciNet  Google Scholar 

  22. H. Mittelmann, J. Peng, Estimating bounds for quadratic assignment problems associated with Hamming and Manhattan distance matrices based on semidefinite programming. SIAM J. Optim. 20, 3408–3426 (2010)

    Article  MathSciNet  Google Scholar 

  23. A. Neumaier, Distances, graphs and designs. Eur. J. Combin. 1, 163–174 (1980)

    Article  MathSciNet  Google Scholar 

  24. A. Neumaier, Distance matrices, dimension and conference graphs. Nederl. Akad. Wetensch. Indag. Math. 43, 385–391 (1981)

    Article  MathSciNet  Google Scholar 

  25. S. Seshu, M.B. Reed, Linear Graphs and Electrical Networks (Addison-Wesley, Reading, 1961)

    MATH  Google Scholar 

  26. G.P.H. Styan, G.E. Subak-Sharpe, Inequalities and equalities associated with the Campbell-Youla generalized inverse of the indefinite admittance matrix of resistive networks. Linear Algebra Appl. 250, 349–370 (1997)

    Article  MathSciNet  Google Scholar 

  27. P. Tarazaga, Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry. Linear Algebra Appl. 408, 1–13 (2005)

    Article  MathSciNet  Google Scholar 

  28. P. Tarazaga, T.L. Hayden, J. Wells, Circum-Euclidean distance matrices and faces. Linear Algebra Appl. 232, 77–96 (1996)

    Article  MathSciNet  Google Scholar 

  29. P. Tarazaga, B. Sterba-Boatwright, K. Wijewardena, Euclidean distance matrices: special subsets, systems of coordinates and multibalanced matrices. Comput. Appl. Math. 26, 415–438 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Alfakih, A.Y. (2018). Classes of EDMs. In: Euclidean Distance Matrices and Their Applications in Rigidity Theory. Springer, Cham. https://doi.org/10.1007/978-3-319-97846-8_4

Download citation

Publish with us

Policies and ethics