On the clique number of a strongly regular graph

On the clique number of a strongly regular graph

We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including infinitely many parameter tuples that correspond to Paley grap...

Full description

Saved in:
Bibliographic Details
Main Authors: Greaves, Gary Royden Watson, Soicher, Leonard H.
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2021
Subjects:
Science::Mathematics
Delsarte Bound
Hoffman Bound
Online Access:https://hdl.handle.net/10356/146667
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including infinitely many parameter tuples that correspond to Paley graphs.

Similar Items