Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/146667| Title: | On the clique number of a strongly regular graph | Authors: | Greaves, Gary Royden Watson Soicher, Leonard H. |
Keywords: | Science::Mathematics | Issue Date: | 2018 | Source: | 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 | Journal: | Electronic Journal of Combinatorics | Abstract: | 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. | URI: | https://hdl.handle.net/10356/146667 | ISSN: | 1077-8926 | DOI: | 10.37236/7873 | Rights: | © 2018 The Authors. Released under the CC BY-ND license (International 4.0). | Fulltext Permission: | open | Fulltext Availability: | With Fulltext |
| Appears in Collections: | SPMS Journal Articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| On the Clique Number of a Strongly Regular Graph.pdf | 3.54 MB | Adobe PDF | View/Open |
Page view(s)
115
Updated on May 17, 2022
Download(s)
16
Updated on May 17, 2022
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.