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><...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2018-04-01
|
| Serier: | Electronic Journal of Graph Theory and Applications |
| Fag: | |
| Online adgang: | http://www.ejgta.org/index.php/ejgta/article/view/435 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|
