{"id":"https://openalex.org/W2064419733","doi":"https://doi.org/10.1142/s1793830909000154","title":"ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS","display_name":"ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2064419733","doi":"https://doi.org/10.1142/s1793830909000154","mag":"2064419733"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830909000154","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830909000154","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062035495","display_name":"He Sun","orcid":"https://orcid.org/0000-0002-5852-3125"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"HE SUN","raw_affiliation_strings":["Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, 220 Handan Road, Shanghai, 200433, P. R. China"],"affiliations":[{"raw_affiliation_string":"Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, 220 Handan Road, Shanghai, 200433, P. R. China","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108056474","display_name":"Hong Zhu","orcid":"https://orcid.org/0000-0001-9815-3934"},"institutions":[{"id":"https://openalex.org/I66867065","display_name":"East China Normal University","ror":"https://ror.org/02n96ep67","country_code":"CN","type":"education","lineage":["https://openalex.org/I66867065"]},{"id":"https://openalex.org/I4210139618","display_name":"Shanghai Key Laboratory of Trustworthy Computing","ror":"https://ror.org/030qbr085","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210139618"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"HONG ZHU","raw_affiliation_strings":["Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, 3663 North Zhongshan Road, Shanghai, 200062, P. R. China"],"affiliations":[{"raw_affiliation_string":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, 3663 North Zhongshan Road, Shanghai, 200062, P. R. China","institution_ids":["https://openalex.org/I4210139618","https://openalex.org/I66867065"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062035495"],"corresponding_institution_ids":["https://openalex.org/I24943067"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.13850564,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"01","issue":"02","first_page":"193","last_page":"203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T11476","display_name":"Graph theory and applications","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T10849","display_name":"Finite Group Theory Research","score":0.9941999912261963,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9830999970436096,"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/ramanujans-sum","display_name":"Ramanujan's sum","score":0.9044542908668518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6981399655342102},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6282572746276855},{"id":"https://openalex.org/keywords/graph-product","display_name":"Graph product","score":0.6254990696907043},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.5732939839363098},{"id":"https://openalex.org/keywords/invertible-matrix","display_name":"Invertible matrix","score":0.5226226449012756},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5202049612998962},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5053451657295227},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.49935436248779297},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.4512093663215637},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.43703263998031616},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4150787591934204},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.38319694995880127},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18023091554641724},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.13079619407653809}],"concepts":[{"id":"https://openalex.org/C131220774","wikidata":"https://www.wikidata.org/wiki/Q1441456","display_name":"Ramanujan's sum","level":2,"score":0.9044542908668518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6981399655342102},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6282572746276855},{"id":"https://openalex.org/C68103157","wikidata":"https://www.wikidata.org/wiki/Q569347","display_name":"Graph product","level":5,"score":0.6254990696907043},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.5732939839363098},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.5226226449012756},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5202049612998962},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5053451657295227},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.49935436248779297},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.4512093663215637},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.43703263998031616},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4150787591934204},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.38319694995880127},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18023091554641724},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.13079619407653809}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1142/s1793830909000154","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830909000154","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/e65f532f-2280-4f56-9a62-bcaf92749120","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/e65f532f-2280-4f56-9a62-bcaf92749120","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Sun, H & Zhu, H 2009, 'On Construction of Almost-Ramanujan Graphs', Discrete Mathematics Algorithms and Applications, vol. 1, no. 2, pp. 193-204. https://doi.org/10.1142/S1793830909000154","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.222.9856","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.9856","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/%7Ehsun/COCOA09.pdf","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/afc8c786-b6ff-4c68-a8d1-8592e9a83a76","is_oa":false,"landing_page_url":"https://hdl.handle.net/1983/afc8c786-b6ff-4c68-a8d1-8592e9a83a76","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sun , H & Zhu , H 2009 , On Construction of Almost-Ramanujan Graphs . in Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings . pp. 197-207 . https://doi.org/10.1007/978-3-642-02026-1_18","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/e65f532f-2280-4f56-9a62-bcaf92749120","is_oa":false,"landing_page_url":"https://hdl.handle.net/1983/e65f532f-2280-4f56-9a62-bcaf92749120","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sun , H & Zhu , H 2009 , ' On Construction of Almost-Ramanujan Graphs ' , Discrete Mathematics Algorithms and Applications , vol. 1 , no. 2 , pp. 193-204 . https://doi.org/10.1142/S1793830909000154","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1512371369","https://openalex.org/W2018047324","https://openalex.org/W2032230430","https://openalex.org/W2036871172","https://openalex.org/W2058056091","https://openalex.org/W4235946010"],"related_works":["https://openalex.org/W2100288217","https://openalex.org/W2963265122","https://openalex.org/W2983588208","https://openalex.org/W4301822686","https://openalex.org/W2047342855","https://openalex.org/W3154783603","https://openalex.org/W4385414273","https://openalex.org/W123672721","https://openalex.org/W4224325481","https://openalex.org/W1919313975"],"abstract_inverted_index":{"O.":[0],"Reingold":[1],"et":[2],"al.":[3],"introduced":[4],"the":[5,23,31,39,49,84,107,110,119,136,148,156],"notion":[6],"zig-zag":[7,63,133,137],"product":[8,64,138],"on":[9,102],"two":[10],"different":[11],"graphs,":[12,116],"and":[13,71,106,113,143,159],"presented":[14],"a":[15,79,129,167],"fully":[16,170],"explicit":[17],"construction":[18,100,120],"of":[19,81,132,139,169],"d-regular":[20],"expanders":[21,47,82],"with":[22,48,83,147,174],"second":[24,50,85],"largest":[25,51,86],"eigenvalue":[26,52,87],"O(d":[27,53],"-1/3":[28],").":[29,55],"In":[30,123],"same":[32,149],"paper,":[33,125],"they":[34,77,94],"ask":[35],"whether":[36],"or":[37],"not":[38],"similar":[40],"technique":[41],"can":[42],"be":[43,152],"used":[44],"to":[45],"construct":[46],"-1/2":[54,89],"Such":[56],"graphs":[57,146,162,173],"are":[58],"called":[59],"Ramanujan":[60],"graphs.":[61,97],"Recently,":[62],"has":[65],"been":[66],"generalized":[67,130],"by":[68],"A.":[69,72],"Ben-Aroya":[70],"Ta-Shma.":[73],"Using":[74],"this":[75,124],"technique,":[76],"present":[78,166],"family":[80,168],"d":[88],"+":[90],"o(1)":[91],",":[92],"what":[93],"call":[95],"almost-Ramanujan":[96,172],"However,":[98],"their":[99],"relies":[101],"local":[103],"invertible":[104,176],"functions":[105],"dependence":[108],"between":[109],"big":[111,157],"graph":[112,142,158],"several":[114,144,160],"small":[115,161],"which":[117],"makes":[118],"more":[121],"complicated.":[122],"we":[126,164],"shall":[127,165],"give":[128],"theorem":[131],"product.":[134],"Specifically,":[135],"one":[140],"\"big\"":[141],"\"small\"":[145],"size":[150],"will":[151],"formalized.":[153],"By":[154],"choosing":[155],"individually,":[163],"explicitly":[171],"locally":[175],"function":[177],"waived.":[178]},"counts_by_year":[{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}