| Title: | On extremal (almost) edge-girth-regular graphs |
|---|
| Authors: | ID Araujo-Pardo, Gabriela (Author)
ID Kiss, György (Author)
ID Porupsánszki, István (Author) |
|---|
| Files: |  ADAM_Araujo-Pardo,Kiss,Porupsanszki_2025.pdf (547,76 KB)
MD5: 5065E4C5C886948FB0A02F5BBAA18280
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | A k-regular graph of girth g is called an edge-girth-regular graph, or an egr-graph for short, if each of its edges is contained in exactly λ distinct g-cycles. An egr-graph is called extremal for the triple (k, g, λ) if has the smallest possible order. We prove that some graphs arising from incidence graphs of finite planes are extremal egr-graphs. We also prove new lower bounds on the order of egr-graphs. |
|---|
| Keywords: | edge-girth-regular graph, cage problem, finite biaffine planes |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 26.05.2025 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2025 |
|---|
| Number of pages: | 21 str. |
|---|
| Numbering: | Vol. 8, no. 3, [article no.] P3.05 |
|---|
| PID: | 20.500.12556/RUP-22078  |
|---|
| UDC: | 519.17 |
|---|
| eISSN: | 2590-9770 |
|---|
| DOI: | 10.26493/2590-9770.1733.dc9 |
|---|
| Publication date in RUP: | 03.11.2025 |
|---|
| Views: | 132 |
|---|
| Downloads: | 1 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
