Geometric constructions of small regular graphs with girth 7

We present simple, geometric constructions for small regular graphs of girth 7 from the incidence graphs of some generalized quadrangles. We obtain infinite families of (q − 1)-regular, q-regular and (q + 1)-regular graphs of girth 7, for q a prime power. Some of them have the smallest order known so far.

Authors

Institutions

Publication Details

Journal
The Art of Discrete and Applied Mathematics
Published
2024-12-23
DOI
https://doi.org/10.26493/2590-9770.1732.6ac
Citations
1
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.21

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Geometric constructions of small regular graphs with girth 7

György Kiss
1 citations
The Art of Discrete and Applied Mathematics
graph theory and CDMA systems
0.21
article

Geometric constructions of small regular graphs with girth 7

György Kiss
article en
1 citations

Abstract

We present simple, geometric constructions for small regular graphs of girth 7 from the incidence graphs of some generalized quadrangles. We obtain infinite families of (q − 1)-regular, q-regular and (q + 1)-regular graphs of girth 7, for q a prime power. Some of them have the smallest order known so far.

The Art of Discrete and Applied MathematicsVol. 8(3)
Eötvös Loránd University (HU), University of Primorska (SI)
Hungarian Scientific Research Fund, National Research, Development and Innovation Office
Sustainable cities and communities
Openalex Percentile: Top 45%
graph theory and CDMA systems
0.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.