Construction numbers: How to build a graph?
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917852482633728 |
|---|---|
| author | Kainen, Paul C. |
| author_facet | Kainen, Paul C. |
| contents | A construction sequence for a graph is a listing of the elements of the graph (the set of vertices and edges) such that each edge follows both its endpoints. The construction number of the graph is the number of such sequences. We determine this number for various graph families. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_13186 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Construction numbers: How to build a graph? Kainen, Paul C. Combinatorics Artificial Intelligence 05C30, 05A05, 05A15, 06A05, 90B35 A construction sequence for a graph is a listing of the elements of the graph (the set of vertices and edges) such that each edge follows both its endpoints. The construction number of the graph is the number of such sequences. We determine this number for various graph families. |
| title | Construction numbers: How to build a graph? |
| topic | Combinatorics Artificial Intelligence 05C30, 05A05, 05A15, 06A05, 90B35 |
| url | https://arxiv.org/abs/2302.13186 |