{"id":"https://openalex.org/W2154799668","doi":"https://doi.org/10.37236/1647","title":"A Prolific Construction of Strongly Regular Graphs with the $n$-e.c. Property","display_name":"A Prolific Construction of Strongly Regular Graphs with the $n$-e.c. Property","publication_year":2002,"publication_date":"2002-07-19","ids":{"openalex":"https://openalex.org/W2154799668","doi":"https://doi.org/10.37236/1647","mag":"2154799668"},"language":"en","primary_location":{"id":"doi:10.37236/1647","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1647","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v9i1r31/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v9i1r31/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048639170","display_name":"Peter J\u200e. Cameron","orcid":"https://orcid.org/0000-0003-3130-9505"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Peter J. Cameron","raw_affiliation_strings":["School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K","institution_ids":["https://openalex.org/I166337079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052564891","display_name":"Dudley Stark","orcid":"https://orcid.org/0000-0001-8527-3996"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dudley Stark","raw_affiliation_strings":["School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I166337079"],"apc_list":null,"apc_paid":null,"fwci":2.3384,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.88405008,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"9","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8520510196685791},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8214495182037354},{"id":"https://openalex.org/keywords/strongly-regular-graph","display_name":"Strongly regular graph","score":0.6151517033576965},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.582850456237793},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.49758079648017883},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4972424805164337},{"id":"https://openalex.org/keywords/prime-power","display_name":"Prime power","score":0.4800083041191101},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45086392760276794},{"id":"https://openalex.org/keywords/symmetric-graph","display_name":"Symmetric graph","score":0.4477071762084961},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2600547671318054},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.19902780652046204},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.19282212853431702},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.10976892709732056}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8520510196685791},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8214495182037354},{"id":"https://openalex.org/C133875400","wikidata":"https://www.wikidata.org/wiki/Q692823","display_name":"Strongly regular graph","level":5,"score":0.6151517033576965},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.582850456237793},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.49758079648017883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4972424805164337},{"id":"https://openalex.org/C174072685","wikidata":"https://www.wikidata.org/wiki/Q1667469","display_name":"Prime power","level":3,"score":0.4800083041191101},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45086392760276794},{"id":"https://openalex.org/C14201764","wikidata":"https://www.wikidata.org/wiki/Q1205074","display_name":"Symmetric graph","level":5,"score":0.4477071762084961},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2600547671318054},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.19902780652046204},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.19282212853431702},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.10976892709732056},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.37236/1647","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1647","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v9i1r31/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.3.6537","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.6537","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_9/PostScriptfiles/v9i1r31.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.4.927","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_9/PDF/v9i1r31.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1647","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1647","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v9i1r31/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2154799668.pdf","grobid_xml":"https://content.openalex.org/works/W2154799668.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W23397926","https://openalex.org/W97392390","https://openalex.org/W1599914714","https://openalex.org/W1997272082","https://openalex.org/W2034198367","https://openalex.org/W2049228883","https://openalex.org/W2068841914","https://openalex.org/W2109104984","https://openalex.org/W2905110430","https://openalex.org/W4388258552"],"related_works":["https://openalex.org/W2163535310","https://openalex.org/W2068618435","https://openalex.org/W4298204836","https://openalex.org/W2181260218","https://openalex.org/W3202779357","https://openalex.org/W2003166470","https://openalex.org/W4387221664","https://openalex.org/W2041718925","https://openalex.org/W173255084","https://openalex.org/W2313802289"],"abstract_inverted_index":{"A":[0,54],"graph":[1,21,55,64],"is":[2,29,56,61,87,173],"$n$-e.c.$\\,$":[3],"($n$-existentially":[4],"closed)":[5],"if":[6,59],"for":[7,104],"every":[8],"pair":[9,75],"of":[10,14,19,69,76,119,130,164],"subsets":[11],"$U$,":[12],"$W$":[13,51],"the":[15,20,67,91,108,140],"vertex":[16,31],"set":[17],"$V$":[18],"such":[22,35,65,177],"that":[23,36,66,98,128,157,178],"$U\\cap":[24],"W=\\emptyset$":[25],"and":[26,41,45,50],"$|U|+|W|=n$,":[27],"there":[28],"a":[30,62,74,174],"$v\\in":[32],"V-(U\\cup":[33],"W)$":[34],"all":[37],"edges":[38,47],"between":[39,48],"$v$":[40,49],"$U$":[42],"are":[43,52,99,107],"present":[44],"no":[46],"present.":[53],"strongly":[57,95,120,160],"regular":[58,63,96,121,161],"it":[60],"number":[68],"vertices":[70,77],"mutually":[71],"adjacent":[72],"to":[73,101,143,155],"$v_1,v_2\\in":[78],"V$":[79],"depends":[80],"only":[81,94],"on":[82],"whether":[83],"or":[84],"not":[85],"$\\{v_1,v_2\\}$":[86],"an":[88],"edge":[89],"in":[90],"graph.":[92],"The":[93],"graphs":[97,122,163],"known":[100],"be":[102,144],"$n$-e.c.":[103,162],"large":[105],"$n$":[106],"Paley":[109,149],"graphs.":[110],"Recently":[111],"D.":[112],"G.":[113],"Fon-Der-Flaass":[114],"has":[115],"found":[116],"prolific":[117],"constructions":[118,132],"using":[123],"affine":[124,141],"designs.":[125],"He":[126],"notes":[127],"some":[129],"these":[131],"were":[133],"also":[134],"studied":[135],"by":[136],"Wallis.":[137],"By":[138],"taking":[139],"designs":[142,146],"Hadamard":[145],"obtained":[147],"from":[148],"tournaments,":[150],"we":[151],"use":[152],"probabilistic":[153],"methods":[154],"show":[156],"many":[158],"non-isomorphic":[159],"order":[165],"$(q+1)^2$":[166],"exist":[167],"whenever":[168],"$q\\geq":[169],"16":[170],"n^2":[171],"2^{2n}$":[172],"prime":[175],"power":[176],"$q\\equiv":[179],"3\\!\\!\\!\\pmod{4}$.":[180]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}