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
-
Determining finite connected graphs along the quadratic embedding constants of paths
by: Edy Tri Baskoro, et al.
Published: (2021-10-01) -
Squared distance matrices of trees with matrix weights
by: Iswar Mahato, et al.
Published: (2023-05-01) -
Relationship between adjacency and distance matrix of graph of diameter two
by: Siti L. Chasanah, et al.
Published: (2021-12-01) -
On spectral radius of the generalized distance matrix of a graph
by: Shariefuddin Pirzada
Published: (2021-05-01) -
On comparison between the distance energies of a connected graph
by: Hilal A. Ganie, et al.
Published: (2024-11-01)