On dispersability of some circulant graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2021
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911837746888704 |
|---|---|
| author | Kainen, Paul C. Joslin, Samuel S. Overbay, Shannon |
| author_facet | Kainen, Paul C. Joslin, Samuel S. Overbay, Shannon |
| contents | The matching book thickness of a graph is the least number of pages in a book embedding such that each page is a matching. A graph is dispersable if its matching book thickness equals its maximum degree. Minimum page matching book embeddings are given for bipartite and for most non-bipartite circulants contained in the (Harary) cube of a cycle and for various higher-powers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_10163 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | On dispersability of some circulant graphs Kainen, Paul C. Joslin, Samuel S. Overbay, Shannon Combinatorics 05C10 (Primary) 05C15, 68R10 (Secondary) The matching book thickness of a graph is the least number of pages in a book embedding such that each page is a matching. A graph is dispersable if its matching book thickness equals its maximum degree. Minimum page matching book embeddings are given for bipartite and for most non-bipartite circulants contained in the (Harary) cube of a cycle and for various higher-powers. |
| title | On dispersability of some circulant graphs |
| topic | Combinatorics 05C10 (Primary) 05C15, 68R10 (Secondary) |
| url | https://arxiv.org/abs/2109.10163 |