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...
Saved in:
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2021
|
| Subjects: | |
| 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 |
| id |
sg-ntu-dr.10356-146667 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.10356-1466672023-02-28T19:59:33Z On the clique number of a strongly regular graph Greaves, Gary Royden Watson Soicher, Leonard H. School of Physical and Mathematical Sciences Science::Mathematics Delsarte Bound Hoffman Bound 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. Published version 2021-03-04T07:13:56Z 2021-03-04T07:13:56Z 2018 Journal Article Greaves, G. R. W., & Soicher, L. H. (2018). On the clique number of a strongly regular graph. Electronic Journal of Combinatorics, 25(4), P4.15-. doi:10.37236/7873 1077-8926 https://hdl.handle.net/10356/146667 10.37236/7873 4 25 en Electronic Journal of Combinatorics © 2018 The Authors. Released under the CC BY-ND license (International 4.0). application/pdf |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
NTU Library |
| collection |
DR-NTU |
| language |
English |
| topic |
Science::Mathematics Delsarte Bound Hoffman Bound |
| spellingShingle |
Science::Mathematics Delsarte Bound Hoffman Bound Greaves, Gary Royden Watson Soicher, Leonard H. On the clique number of a strongly regular graph |
| description |
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. |
| author2 |
School of Physical and Mathematical Sciences |
| author_facet |
School of Physical and Mathematical Sciences Greaves, Gary Royden Watson Soicher, Leonard H. |
| format |
Article |
| author |
Greaves, Gary Royden Watson Soicher, Leonard H. |
| author_sort |
Greaves, Gary Royden Watson |
| title |
On the clique number of a strongly regular graph |
| title_short |
On the clique number of a strongly regular graph |
| title_full |
On the clique number of a strongly regular graph |
| title_fullStr |
On the clique number of a strongly regular graph |
| title_full_unstemmed |
On the clique number of a strongly regular graph |
| title_sort |
on the clique number of a strongly regular graph |
| publishDate |
2021 |
| url |
https://hdl.handle.net/10356/146667 |
| _version_ |
1759858103428317184 |