A search for regular K3-irregular graphs
| dc.contributor.author | Hak, Artem | en_US |
| dc.date.accessioned | 2025-01-29T07:51:50Z | |
| dc.date.available | 2025-01-29T07:51:50Z | |
| dc.date.issued | 2024 | |
| dc.description.abstract | For a given graph F, the F-degree of a vertex v in G is the number of subgraphs of G, isomorphic to F, to which v belongs. A graph G is called F-irregular if all vertices of G have distinct F-degrees. In [1], the existence of regular K3-irregular graphs was posed as an open question. Examples of such graphs for regularities r ∈ {10, 11, 12} were constructed in [2]. We analytically prove that no such graphs exist for r ≤ 7, present such a graph for r = 9, and establish bounds on the order for r = 8. We will use t(v) to denote the K3-degree. | en_US |
| dc.identifier.citation | Hak A. A search for regular K3-irregular graphs / Artem Hak // Ukraine Mathematics Conference "At the End of the Year 2024", December 16–18, 2024 : book of abstracts / Taras Shevchenko National University of Kyiv, Institute of Mathematics of National Academy of Sciences of Ukraine. - Kyiv, 2024. - P. 30. | en_US |
| dc.identifier.uri | https://ekmair.ukma.edu.ua/handle/123456789/33362 | |
| dc.language.iso | en | en_US |
| dc.relation.source | Ukraine Mathematics Conference "At the End of the Year 2024", December 16–18, 2024 : book of abstracts | en_US |
| dc.status | first published | en_US |
| dc.subject | K3-irregular graphs | en_US |
| dc.subject | graph F | en_US |
| dc.subject | subgraphs of G | en_US |
| dc.subject | conference abstracts | en_US |
| dc.title | A search for regular K3-irregular graphs | en_US |
| dc.type | Conference materials | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Hak_A_search_for_regular_K3-irregular_graphs.pdf
- Size:
- 242.87 KB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: