On highly regular strongly regular graphs

From MaRDI portal
Revision as of 20:26, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2065709

DOI10.5802/ALCO.183zbMATH Open1492.05166arXiv1404.7716OpenAlexW3212988773MaRDI QIDQ2065709FDOQ2065709

Christian Pech

Publication date: 12 January 2022

Published in: Algebraic Combinatorics (Search for Journal in Brave)

Abstract: In this paper we unify several existing regularity conditions for graphs, including strong regularity, k-isoregularity, and the t-vertex condition. We develop an algebraic composition/decomposition theory of regularity conditions. Using our theoretical results we show that a family of non rank 3 graphs known to satisfy the 7-vertex condition fulfills an even stronger condition, (3,7)-regularity (the notion is defined in the text). Derived from this family we obtain a new infinite family of non rank 3 strongly regular graphs satisfying the 6-vertex condition. This strengthens and generalizes previous results by Reichard.


Full work available at URL: https://arxiv.org/abs/1404.7716





Cites Work


Cited In (15)

Uses Software






This page was built for publication: On highly regular strongly regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065709)