On quadratic embeddability of bipartite graphs and theta graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _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 |