Distance matrices and quadratic embedding of graphs
<p>A connected graph is said to be of <span class="math"><em>Q</em><em>E</em></span> 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 gra...
Main Authors: | Nobuaki Obata, Alfi Y. Zakiyyah |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2018-04-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/435 |
Similar Items
-
A note on completing quasi-distance and distance matrices
by: Zhang Yulin, et al.
Published: (2019-12-01) -
On spectral radius of the generalized distance matrix of a graph
by: Shariefuddin Pirzada
Published: (2021-05-01) -
Degree Distance and Gutman Index of Two Graph Products
by: Shaban Sedghi, et al.
Published: (2020-05-01) -
Moore-Penrose inverse of a hollow symmetric
matrix and a predistance matrix
by: Kurata Hiroshi, et al.
Published: (2016-07-01) -
Agglomerative Clustering of Network Traffic Based on Various Approaches to Determining the Distance Matrix
by: Vladimir Deart, et al.
Published: (2021-01-01)