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 graph to be of <span class="math"><em>Q</em><em>E</em><...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2018-04-01
|
| Серии: | Electronic Journal of Graph Theory and Applications |
| Предметы: | |
| Online-ссылка: | http://www.ejgta.org/index.php/ejgta/article/view/435 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|