{"id":"https://openalex.org/W2114577263","doi":"https://doi.org/10.37236/415","title":"On Graphs with Cyclic Defect or Excess","display_name":"On Graphs with Cyclic Defect or Excess","publication_year":2010,"publication_date":"2010-10-29","ids":{"openalex":"https://openalex.org/W2114577263","doi":"https://doi.org/10.37236/415","mag":"2114577263"},"language":"en","primary_location":{"id":"doi:10.37236/415","is_oa":true,"landing_page_url":"https://doi.org/10.37236/415","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r143/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":true,"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":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r143/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084137628","display_name":"Charles Delorme","orcid":null},"institutions":[{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Charles Delorme","raw_affiliation_strings":["Laboratoire de Recherche en Informatique Universit Paris-Sud","Laboratory for Computer Science (University of Paris-Sud)"],"affiliations":[{"raw_affiliation_string":"Laboratoire de Recherche en Informatique Universit Paris-Sud","institution_ids":["https://openalex.org/I4210144804"]},{"raw_affiliation_string":"Laboratory for Computer Science (University of Paris-Sud)","institution_ids":["https://openalex.org/I102197404"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044609877","display_name":"Guillermo Pineda\u2010Villavicencio","orcid":"https://orcid.org/0000-0002-2904-6657"},"institutions":[{"id":"https://openalex.org/I4210089412","display_name":"Applied Optimization (United States)","ror":"https://ror.org/004b0n253","country_code":"US","type":"company","lineage":["https://openalex.org/I4210089412"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guillermo Pineda-Villavicencio","raw_affiliation_strings":["Centre for Informatics and Applied Optimization University of Ballarat"],"affiliations":[{"raw_affiliation_string":"Centre for Informatics and Applied Optimization University of Ballarat","institution_ids":["https://openalex.org/I4210089412"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084137628"],"corresponding_institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804"],"apc_list":null,"apc_paid":null,"fwci":0.7433,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.70759289,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"17","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":1.0,"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":1.0,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9994000196456909,"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.9993000030517578,"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.8844442367553711},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7150696516036987},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.6354882717132568},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.571841299533844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4914463758468628},{"id":"https://openalex.org/keywords/odd-graph","display_name":"Odd graph","score":0.4591699242591858},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4432777464389801},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.43980351090431213},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.38518786430358887},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3326304256916046}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8844442367553711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7150696516036987},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.6354882717132568},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.571841299533844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4914463758468628},{"id":"https://openalex.org/C206815938","wikidata":"https://www.wikidata.org/wiki/Q7077445","display_name":"Odd graph","level":5,"score":0.4591699242591858},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4432777464389801},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.43980351090431213},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.38518786430358887},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3326304256916046},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/415","is_oa":true,"landing_page_url":"https://doi.org/10.37236/415","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r143/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":true,"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"}],"best_oa_location":{"id":"doi:10.37236/415","is_oa":true,"landing_page_url":"https://doi.org/10.37236/415","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r143/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":true,"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/W2114577263.pdf","grobid_xml":"https://content.openalex.org/works/W2114577263.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W180810406","https://openalex.org/W645879618","https://openalex.org/W789031382","https://openalex.org/W1515707356","https://openalex.org/W1558273801","https://openalex.org/W1576727573","https://openalex.org/W1986449012","https://openalex.org/W2025318306","https://openalex.org/W2032748226","https://openalex.org/W2042238621","https://openalex.org/W2050883310","https://openalex.org/W2059998776","https://openalex.org/W2094898130","https://openalex.org/W2316756619","https://openalex.org/W2479778494","https://openalex.org/W2798588639","https://openalex.org/W2956345910","https://openalex.org/W3183392806","https://openalex.org/W4254246953","https://openalex.org/W4299651613"],"related_works":["https://openalex.org/W603403972","https://openalex.org/W1554245510","https://openalex.org/W2152638828","https://openalex.org/W2061237693","https://openalex.org/W3121955789","https://openalex.org/W1578113210","https://openalex.org/W2239518402","https://openalex.org/W2083238533","https://openalex.org/W2579368376","https://openalex.org/W3035161677"],"abstract_inverted_index":{"The":[0],"Moore":[1,44,58],"bound":[2,7,24,45,224,242],"constitutes":[3],"both":[4],"an":[5],"upper":[6,223],"on":[8,25,281],"the":[9,26,43,92,107,111,119,129,147,151,166,173,184,196,206,214,217,221,228,256,278],"order":[10,27,180],"of":[11,14,28,31,110,132,135,153,155,163,176,179,198,208,216,225,230,232,252,258,261,263,287],"a":[12,22,29,82,133,140,177,250],"graph":[13,30,112,286],"maximum":[15],"degree":[16,33,234,265,289],"$d$":[17,34],"and":[18,21,35,63,138,236,248,267,292],"diameter":[19],"$D=k$":[20],"lower":[23],"minimum":[32],"odd":[36,233,264],"girth":[37],"$g=2k+1$.":[38],"Graphs":[39,86],"missing":[40],"or":[41,53,67,78,191,239,270,295],"exceeding":[42],"by":[46],"$\\epsilon$":[47],"are":[48,125,195],"called":[49],"graphs":[50,59,64,75,186,187,194,231,262],"with":[51,61,65,76,87,142,188],"defect":[52,66,77,88,190,238,269,294],"excess":[54,68,79,296],"$\\epsilon$,":[55],"respectively.":[56],"While":[57],"(graphs":[60],"$\\epsilon=0$)":[62],"1":[69],"have":[70],"been":[71],"characterized":[72],"almost":[73],"completely,":[74],"2":[80,90],"represent":[81],"wide":[83],"unexplored":[84],"area.":[85],"(excess)":[89],"satisfy":[91],"equation":[93],"$G_{d,k}(A)":[94],"=":[95,100],"J_n":[96,101],"+":[97],"B$":[98],"($G_{d,k}(A)":[99],"-":[102],"B$),":[103],"where":[104],"$A$":[105],"denotes":[106],"adjacency":[108,130,174],"matrix":[109,122,131,148,175],"in":[113,165,201,244],"question,":[114],"$n$":[115,181],"its":[116],"order,":[117],"$J_n$":[118],"$n\\times":[120],"n$":[121],"whose":[123],"entries":[124],"all":[126],"1's,":[127],"$B$":[128,171],"union":[134],"vertex-disjoint":[136],"cycles,":[137],"$G_{d,k}(x)$":[139],"polynomial":[141],"integer":[143],"coefficients":[144],"such":[145,211],"that":[146],"$G_{d,k}(A)$":[149],"gives":[150],"number":[152,229],"paths":[154],"length":[156],"at":[157],"most":[158],"$k$":[159],"joining":[160],"each":[161],"pair":[162],"vertices":[164],"graph.":[167],"In":[168],"particular,":[169],"if":[170],"is":[172,243],"cycle":[178],"we":[182,219,254,273],"call":[183],"corresponding":[185],"cyclic":[189,237,268,293],"excess;":[192],"these":[193],"subject":[197],"our":[199],"attention":[200],"this":[202],"paper.":[203],"We":[204],"prove":[205],"non-existence":[207,257],"infinitely":[209],"many":[210],"graphs.":[212],"As":[213],"highlight":[215],"paper":[218],"provide":[220],"asymptotic":[222],"$O(\\frac{64}3d^{3/2})$":[226],"for":[227],"$d\\ge3$":[235,266],"excess.":[240,271],"This":[241],"fact":[245],"quite":[246],"generous,":[247],"as":[249],"way":[251],"illustration,":[253],"show":[255],"some":[259],"families":[260],"Actually,":[272],"conjecture":[274],"that,":[275],"apart":[276],"from":[277],"M\u00f6bius":[279],"ladder":[280],"8":[282],"vertices,":[283],"no":[284],"non-trivial":[285],"any":[288],"$\\ge":[290],"3$":[291],"exists.":[297]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}