A Note on the McKay–Miller–Širáň Graphs
McKay, Miller, and Širáň (1998, J. Combin. Theory Ser. B74 (1), 110–118) constructed a family of the currently largest known vertex-transitive graphs of degree d, diameter 2, and order 89(d+12)2, for infinitely many values of d. We present a simplified construction of their graphs.
Gespeichert in:
| Veröffentlicht in: | Journal of combinatorial theory. Series B 2001-03, Vol.81 (2), p.205-208 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 208 |
|---|---|
| container_issue | 2 |
| container_start_page | 205 |
| container_title | Journal of combinatorial theory. Series B |
| container_volume | 81 |
| creator | Šiagiová, Jana |
| description | McKay, Miller, and Širáň (1998, J. Combin. Theory Ser. B74 (1), 110–118) constructed a family of the currently largest known vertex-transitive graphs of degree d, diameter 2, and order 89(d+12)2, for infinitely many values of d. We present a simplified construction of their graphs. |
| doi_str_mv | 10.1006/jctb.2000.2006 |
| format | Article |
| fullrecord | <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1006_jctb_2000_2006</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0095895600920069</els_id><sourcerecordid>S0095895600920069</sourcerecordid><originalsourceid>FETCH-LOGICAL-c326t-aafdf9115176efb4de51920e02c9307b75ed738216a498d5685f66675eb46f3d3</originalsourceid><addsrcrecordid>eNp1j7FOwzAQhi0EEqGwMucFEs5x7MRjVUFBtLDAbDn2WXUVmsqOkLoxsvMC8CyoL8KTkKisLP-dTved7iPkkkJOAcTV2vRNXgDAGOKIJBSkyEBCcUwSAMmzWnJxSs5iXA9bjFV1QvJp-tD1mHabtF9hujT3evfz9rH0bYthaPafPnx_7d_TedDbVTwnJ063ES_-6oQ831w_zW6zxeP8bjZdZIYVos-0dtZJSjmtBLqmtMipLAChMJJB1VQcbcXqggpdytpyUXMnhBjGTSkcs2xC8sNdE7oYAzq1Df5Fh52ioEZbNdqq0XYMMQD1AcDhq1ePQUXjcWPQ-oCmV7bz_6G_Lq9dOQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Note on the McKay–Miller–Širáň Graphs</title><source>Elsevier ScienceDirect Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Šiagiová, Jana</creator><creatorcontrib>Šiagiová, Jana</creatorcontrib><description>McKay, Miller, and Širáň (1998, J. Combin. Theory Ser. B74 (1), 110–118) constructed a family of the currently largest known vertex-transitive graphs of degree d, diameter 2, and order 89(d+12)2, for infinitely many values of d. We present a simplified construction of their graphs.</description><identifier>ISSN: 0095-8956</identifier><identifier>EISSN: 1096-0902</identifier><identifier>DOI: 10.1006/jctb.2000.2006</identifier><language>eng</language><publisher>Elsevier Inc</publisher><ispartof>Journal of combinatorial theory. Series B, 2001-03, Vol.81 (2), p.205-208</ispartof><rights>2001 Academic Press</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c326t-aafdf9115176efb4de51920e02c9307b75ed738216a498d5685f66675eb46f3d3</citedby><cites>FETCH-LOGICAL-c326t-aafdf9115176efb4de51920e02c9307b75ed738216a498d5685f66675eb46f3d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1006/jctb.2000.2006$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,777,781,3537,27905,27906,45976</link.rule.ids></links><search><creatorcontrib>Šiagiová, Jana</creatorcontrib><title>A Note on the McKay–Miller–Širáň Graphs</title><title>Journal of combinatorial theory. Series B</title><description>McKay, Miller, and Širáň (1998, J. Combin. Theory Ser. B74 (1), 110–118) constructed a family of the currently largest known vertex-transitive graphs of degree d, diameter 2, and order 89(d+12)2, for infinitely many values of d. We present a simplified construction of their graphs.</description><issn>0095-8956</issn><issn>1096-0902</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><recordid>eNp1j7FOwzAQhi0EEqGwMucFEs5x7MRjVUFBtLDAbDn2WXUVmsqOkLoxsvMC8CyoL8KTkKisLP-dTved7iPkkkJOAcTV2vRNXgDAGOKIJBSkyEBCcUwSAMmzWnJxSs5iXA9bjFV1QvJp-tD1mHabtF9hujT3evfz9rH0bYthaPafPnx_7d_TedDbVTwnJ063ES_-6oQ831w_zW6zxeP8bjZdZIYVos-0dtZJSjmtBLqmtMipLAChMJJB1VQcbcXqggpdytpyUXMnhBjGTSkcs2xC8sNdE7oYAzq1Df5Fh52ioEZbNdqq0XYMMQD1AcDhq1ePQUXjcWPQ-oCmV7bz_6G_Lq9dOQ</recordid><startdate>20010301</startdate><enddate>20010301</enddate><creator>Šiagiová, Jana</creator><general>Elsevier Inc</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20010301</creationdate><title>A Note on the McKay–Miller–Širáň Graphs</title><author>Šiagiová, Jana</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c326t-aafdf9115176efb4de51920e02c9307b75ed738216a498d5685f66675eb46f3d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Šiagiová, Jana</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><jtitle>Journal of combinatorial theory. Series B</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Šiagiová, Jana</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Note on the McKay–Miller–Širáň Graphs</atitle><jtitle>Journal of combinatorial theory. Series B</jtitle><date>2001-03-01</date><risdate>2001</risdate><volume>81</volume><issue>2</issue><spage>205</spage><epage>208</epage><pages>205-208</pages><issn>0095-8956</issn><eissn>1096-0902</eissn><abstract>McKay, Miller, and Širáň (1998, J. Combin. Theory Ser. B74 (1), 110–118) constructed a family of the currently largest known vertex-transitive graphs of degree d, diameter 2, and order 89(d+12)2, for infinitely many values of d. We present a simplified construction of their graphs.</abstract><pub>Elsevier Inc</pub><doi>10.1006/jctb.2000.2006</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0095-8956 |
| ispartof | Journal of combinatorial theory. Series B, 2001-03, Vol.81 (2), p.205-208 |
| issn | 0095-8956 1096-0902 |
| language | eng |
| recordid | cdi_crossref_primary_10_1006_jctb_2000_2006 |
| source | Elsevier ScienceDirect Journals; EZB-FREE-00999 freely available EZB journals |
| title | A Note on the McKay–Miller–Širáň Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T13%3A22%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Note%20on%20the%20McKay%E2%80%93Miller%E2%80%93%C5%A0ir%C3%A1%C5%88%20Graphs&rft.jtitle=Journal%20of%20combinatorial%20theory.%20Series%20B&rft.au=%C5%A0iagiov%C3%A1,%20Jana&rft.date=2001-03-01&rft.volume=81&rft.issue=2&rft.spage=205&rft.epage=208&rft.pages=205-208&rft.issn=0095-8956&rft.eissn=1096-0902&rft_id=info:doi/10.1006/jctb.2000.2006&rft_dat=%3Celsevier_cross%3ES0095895600920069%3C/elsevier_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_els_id=S0095895600920069&rfr_iscdi=true |