Guardado en:
Detalles Bibliográficos
Autores principales: Młotkowski, Wojciech, Skrzypczyk, Marek, Wojtylak, Michał
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:https://arxiv.org/abs/2409.17662
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866914961138122752
author Młotkowski, Wojciech
Skrzypczyk, Marek
Wojtylak, Michał
author_facet Młotkowski, Wojciech
Skrzypczyk, Marek
Wojtylak, Michał
contents We compute the quadratic embedding constant for complete bipartite graphs with disjoint edges removed. Moreover, we study the quadratic embedding property for theta graphs, i.e., graphs consisting of three paths with common initial points and common endpoints. As a result, we provide an infinite family of primary graphs which are not quadratically embeddable.
format Preprint
id arxiv_https___arxiv_org_abs_2409_17662
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle On quadratic embeddability of bipartite graphs and theta graphs
Młotkowski, Wojciech
Skrzypczyk, Marek
Wojtylak, Michał
Combinatorics
We compute the quadratic embedding constant for complete bipartite graphs with disjoint edges removed. Moreover, we study the quadratic embedding property for theta graphs, i.e., graphs consisting of three paths with common initial points and common endpoints. As a result, we provide an infinite family of primary graphs which are not quadratically embeddable.
title On quadratic embeddability of bipartite graphs and theta graphs
topic Combinatorics
url https://arxiv.org/abs/2409.17662