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...
Gespeichert in:
| Veröffentlicht in: | The Electronic journal of combinatorics 2018-10, Vol.25 (4) |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 4 |
| container_start_page | |
| container_title | The Electronic journal of combinatorics |
| container_volume | 25 |
| creator | Greaves, Gary R. W. Soicher, Leonard H. |
| 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. |
| doi_str_mv | 10.37236/7873 |
| format | Article |
| fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_37236_7873</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_37236_7873</sourcerecordid><originalsourceid>FETCH-LOGICAL-c221t-121ed18ab5777a882c6878c6adb85811da525b886388a044d3dc39079b6bb6dc3</originalsourceid><addsrcrecordid>eNpNj7lOAzEUAC0EEiHkH9xQLviI_Z5LtIKAFBGJo149H5sEbbLB3i3y95wF1Uw10jA2k-Jag9L2BhD0CZtIAVChU_b0n5-zi1LehZDKOTNhYrXnwybxutt-jIk_jTufMu9bTvxlyP1-3R35c1qPHWW-yHTYXLKzlrqSZn-csrf7u9f6oVquFo_17bIKSsmhkkqmKJG8AQBCVMEiYLAUPRqUMpJRxiNajUhiPo86Bu0EOG-9t18-ZVe_3ZD7UnJqm0Pe7igfGyman83me1N_AhOfQhA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On the Clique Number of a Strongly Regular Graph</title><source>DOAJ Directory of Open Access Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Greaves, Gary R. W. ; Soicher, Leonard H.</creator><creatorcontrib>Greaves, Gary R. W. ; Soicher, Leonard H.</creatorcontrib><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.</description><identifier>ISSN: 1077-8926</identifier><identifier>EISSN: 1077-8926</identifier><identifier>DOI: 10.37236/7873</identifier><language>eng</language><ispartof>The Electronic journal of combinatorics, 2018-10, Vol.25 (4)</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c221t-121ed18ab5777a882c6878c6adb85811da525b886388a044d3dc39079b6bb6dc3</citedby><orcidid>0000-0002-7342-4790</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,860,27901,27902</link.rule.ids></links><search><creatorcontrib>Greaves, Gary R. W.</creatorcontrib><creatorcontrib>Soicher, Leonard H.</creatorcontrib><title>On the Clique Number of a Strongly Regular Graph</title><title>The Electronic journal of combinatorics</title><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.</description><issn>1077-8926</issn><issn>1077-8926</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNpNj7lOAzEUAC0EEiHkH9xQLviI_Z5LtIKAFBGJo149H5sEbbLB3i3y95wF1Uw10jA2k-Jag9L2BhD0CZtIAVChU_b0n5-zi1LehZDKOTNhYrXnwybxutt-jIk_jTufMu9bTvxlyP1-3R35c1qPHWW-yHTYXLKzlrqSZn-csrf7u9f6oVquFo_17bIKSsmhkkqmKJG8AQBCVMEiYLAUPRqUMpJRxiNajUhiPo86Bu0EOG-9t18-ZVe_3ZD7UnJqm0Pe7igfGyman83me1N_AhOfQhA</recordid><startdate>20181019</startdate><enddate>20181019</enddate><creator>Greaves, Gary R. W.</creator><creator>Soicher, Leonard H.</creator><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-7342-4790</orcidid></search><sort><creationdate>20181019</creationdate><title>On the Clique Number of a Strongly Regular Graph</title><author>Greaves, Gary R. W. ; Soicher, Leonard H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c221t-121ed18ab5777a882c6878c6adb85811da525b886388a044d3dc39079b6bb6dc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Greaves, Gary R. W.</creatorcontrib><creatorcontrib>Soicher, Leonard H.</creatorcontrib><collection>CrossRef</collection><jtitle>The Electronic journal of combinatorics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Greaves, Gary R. W.</au><au>Soicher, Leonard H.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Clique Number of a Strongly Regular Graph</atitle><jtitle>The Electronic journal of combinatorics</jtitle><date>2018-10-19</date><risdate>2018</risdate><volume>25</volume><issue>4</issue><issn>1077-8926</issn><eissn>1077-8926</eissn><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.</abstract><doi>10.37236/7873</doi><orcidid>https://orcid.org/0000-0002-7342-4790</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1077-8926 |
| ispartof | The Electronic journal of combinatorics, 2018-10, Vol.25 (4) |
| issn | 1077-8926 1077-8926 |
| language | eng |
| recordid | cdi_crossref_primary_10_37236_7873 |
| source | DOAJ Directory of Open Access Journals; EZB-FREE-00999 freely available EZB journals |
| title | On the Clique Number of a Strongly Regular Graph |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T05%3A19%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20Clique%20Number%20of%20a%20Strongly%20Regular%20Graph&rft.jtitle=The%20Electronic%20journal%20of%20combinatorics&rft.au=Greaves,%20Gary%20R.%20W.&rft.date=2018-10-19&rft.volume=25&rft.issue=4&rft.issn=1077-8926&rft.eissn=1077-8926&rft_id=info:doi/10.37236/7873&rft_dat=%3Ccrossref%3E10_37236_7873%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |