Distance matrices and quadratic embedding of graphs
A connected graph is said to be of QE class if it admits a quadratic embedding in a Hilbert space, or equivalently, if the distance matrix is conditionally negative definite. Several criteria for a graph to be of QE class are derived from the point of view of graph operations. For a quantitative cri...
Saved in:
Main Authors: | , |
---|---|
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2018-04-03.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!