Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings

An embedding [Formula: see text] of the vertices of a graph G is called universally completable if the following holds: For any other embedding [Formula: see text] satisfying [Formula: see text] for [Formula: see text] and i adjacent to j, there exists an isometry mapping [Formula: see text] to [For...

Descripción completa

Detalles Bibliográficos
Autores principales: Godsil, Chris, Roberson, David E., Rooney, Brendan, Šámal, Robert, Varvitsiotis, Antonios
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2017
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6979529/
https://www.ncbi.nlm.nih.gov/pubmed/32025074
http://dx.doi.org/10.1007/s00454-017-9899-2

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6979529/
https://www.ncbi.nlm.nih.gov/pubmed/32025074
http://dx.doi.org/10.1007/s00454-017-9899-2

Ejemplares similares