{"id":"https://openalex.org/W7160917068","doi":"https://doi.org/10.1016/j.dam.2026.04.043","title":"Eigenvalue bounds for distance-edge colourings","display_name":"Eigenvalue bounds for distance-edge colourings","publication_year":2026,"publication_date":"2026-05-12","ids":{"openalex":"https://openalex.org/W7160917068","doi":"https://doi.org/10.1016/j.dam.2026.04.043"},"language":"en","primary_location":{"id":"doi:10.1016/j.dam.2026.04.043","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2026.04.043","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.dam.2026.04.043","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135986937","display_name":"Aida Abiad","orcid":"https://orcid.org/0000-0003-4003-4291"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aida Abiad","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4003-4291","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135947261","display_name":"Harper Reijnders","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harper Reijnders","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":{"value":2750,"currency":"USD","value_usd":2750},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.75937393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"391","issue":null,"first_page":"176","last_page":"191"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.2506999969482422,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.2506999969482422,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.07590000331401825,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.058800000697374344,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.6484000086784363},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5813999772071838},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5177000164985657},{"id":"https://openalex.org/keywords/algebraic-connectivity","display_name":"Algebraic connectivity","score":0.503000020980835},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.44519999623298645},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.42980000376701355},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4287000000476837},{"id":"https://openalex.org/keywords/spectral-graph-theory","display_name":"Spectral graph theory","score":0.4194999933242798},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4115000069141388}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8830999732017517},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.6484000086784363},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6132000088691711},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5813999772071838},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5177000164985657},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5177000164985657},{"id":"https://openalex.org/C7948225","wikidata":"https://www.wikidata.org/wiki/Q4723998","display_name":"Algebraic connectivity","level":4,"score":0.503000020980835},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.44519999623298645},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.42980000376701355},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4287000000476837},{"id":"https://openalex.org/C74003402","wikidata":"https://www.wikidata.org/wiki/Q3180727","display_name":"Spectral graph theory","level":5,"score":0.4194999933242798},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4115000069141388},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.36579999327659607},{"id":"https://openalex.org/C126385604","wikidata":"https://www.wikidata.org/wiki/Q1087609","display_name":"Chromatic polynomial","level":3,"score":0.3555000126361847},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3474000096321106},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3093999922275543},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.3000999987125397},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.29789999127388},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2922999858856201},{"id":"https://openalex.org/C204710682","wikidata":"https://www.wikidata.org/wiki/Q3036983","display_name":"Integral graph","level":5,"score":0.2888000011444092},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C2985906921","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Spectral properties","level":2,"score":0.273499995470047},{"id":"https://openalex.org/C115178988","wikidata":"https://www.wikidata.org/wiki/Q772067","display_name":"Laplacian matrix","level":3,"score":0.2694999873638153},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2612999975681305},{"id":"https://openalex.org/C14447369","wikidata":"https://www.wikidata.org/wiki/Q7857002","display_name":"Tutte polynomial","level":5,"score":0.2578999996185303},{"id":"https://openalex.org/C167750561","wikidata":"https://www.wikidata.org/wiki/Q1789512","display_name":"Critical graph","level":5,"score":0.25519999861717224}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.dam.2026.04.043","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2026.04.043","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/cb065cbc-a214-46da-a7c7-60da87cf907c","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/cb065cbc-a214-46da-a7c7-60da87cf907c","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abiad Monge, A & Reijnders, H 2026, 'Eigenvalue bounds for distance-edge colourings', Discrete Applied Mathematics, vol. 391, pp. 176-191. https://doi.org/10.1016/j.dam.2026.04.043","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1016/j.dam.2026.04.043","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2026.04.043","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1966769222","https://openalex.org/W1967598767","https://openalex.org/W1994037159","https://openalex.org/W2014486909","https://openalex.org/W2029496510","https://openalex.org/W2048352893","https://openalex.org/W2053777090","https://openalex.org/W2065003601","https://openalex.org/W2071409134","https://openalex.org/W2078294311","https://openalex.org/W2081302318","https://openalex.org/W2088103653","https://openalex.org/W2089589410","https://openalex.org/W2102669784","https://openalex.org/W2114547177","https://openalex.org/W2144580685","https://openalex.org/W2167763892","https://openalex.org/W2583600317","https://openalex.org/W2759117083","https://openalex.org/W2963456428","https://openalex.org/W2963682341","https://openalex.org/W3040816021","https://openalex.org/W3216457453","https://openalex.org/W4223516954","https://openalex.org/W4248246896","https://openalex.org/W4367048681","https://openalex.org/W4408311652","https://openalex.org/W4415906973"],"related_works":[],"abstract_inverted_index":{"For":[0],"a":[1,42,61,112,123],"fixed":[2],"positive":[3],"integer":[4,68],"t,":[5],"we":[6,95,117],"consider":[7],"the":[8,30,34,53,56,91,97,99,104,127],"graph":[9,58,75,113],"colouring":[10],"problem":[11],"in":[12],"which":[13,63,89,111],"edges":[14],"at":[15,17],"distance":[16],"most":[18],"t":[19],"are":[20,46],"given":[21],"distinct":[22],"colours.":[23],"We":[24,72],"obtain":[25,122],"sharp":[26],"lower":[27],"bounds":[28,45],"for":[29,40,80,103],"distance-t":[31],"chromatic":[32],"index,":[33],"least":[35],"number":[36],"of":[37,47,55],"colours":[38],"necessary":[39],"such":[41],"colouring.":[43],"Our":[44],"algebraic":[48],"nature;":[49],"they":[50],"depend":[51],"on":[52,60],"eigenvalues":[54],"line":[57],"and":[59,83,107],"polynomial":[62],"can":[64],"be":[65],"found":[66],"using":[67],"linear":[69],"programming":[70],"methods.":[71,130],"provide":[73],"several":[74],"classes":[76],"that":[77],"attain":[78],"equality":[79],"our":[81],"bounds,":[82],"also":[84],"present":[85],"some":[86,109],"computational":[87],"results":[88],"illustrate":[90],"bound\u2019s":[92],"performance.":[93],"Lastly,":[94],"investigate":[96],"implications":[98],"spectral":[100,129],"approach":[101],"has":[102],"Erd\u0151s\u2013Ne\u0161et\u0159il":[105],"conjecture,":[106],"derive":[108],"conditions":[110],"must":[114],"satisfy":[115],"if":[116],"could":[118],"use":[119],"it":[120],"to":[121],"counter":[124],"example":[125],"through":[126],"proposed":[128]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-13T00:00:00"}