تقرير
On extremal (almost) edge-girth-regular graphs
| العنوان: | On extremal (almost) edge-girth-regular graphs |
|---|---|
| المؤلفون: | Araujo-Pardo, Gabriela, Kiss, György, Porupsánszki, István |
| سنة النشر: | 2024 |
| المجموعة: | Mathematics |
| مصطلحات موضوعية: | Mathematics - Combinatorics, 05C35, 51E12, 51E15 |
| الوصف: | A $k$-regular graph of girth $g$ is called edge-girth-regular graph, shortly egr-graph, if each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. An egr-graph is called extremal for the triple $(k, g, \lambda)$ 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. Comment: 24 pages, 5 figures |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2401.15411 |
| رقم الأكسشن: | edsarx.2401.15411 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |