Searching for regular, triangle-distinct graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929217681227776 |
|---|---|
| author | Stevanović, Dragan Ghebleh, Mohammad Caporossi, Gilles Vijayakumar, Ambat Stevanović, Sanja |
| author_facet | Stevanović, Dragan Ghebleh, Mohammad Caporossi, Gilles Vijayakumar, Ambat Stevanović, Sanja |
| contents | The triangle-degree of a vertex v of a simple graph G is the number of triangles in G that contain v. A simple graph is triangle-distinct if all its vertices have distinct triangle-degrees. Berikkyzy et al. [Discrete Math. 347 (2024) 113695] recently asked whether there exists a regular graph that is triangle-distinct. Here we showcase the examples of regular, triangle-distinct graphs with orders between 21 and 27, and report on the methodology used to find them. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_10971 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Searching for regular, triangle-distinct graphs Stevanović, Dragan Ghebleh, Mohammad Caporossi, Gilles Vijayakumar, Ambat Stevanović, Sanja Combinatorics 05C07 The triangle-degree of a vertex v of a simple graph G is the number of triangles in G that contain v. A simple graph is triangle-distinct if all its vertices have distinct triangle-degrees. Berikkyzy et al. [Discrete Math. 347 (2024) 113695] recently asked whether there exists a regular graph that is triangle-distinct. Here we showcase the examples of regular, triangle-distinct graphs with orders between 21 and 27, and report on the methodology used to find them. |
| title | Searching for regular, triangle-distinct graphs |
| topic | Combinatorics 05C07 |
| url | https://arxiv.org/abs/2401.10971 |