{"id":"https://openalex.org/W4408736823","doi":"https://doi.org/10.61091/ars162-02","title":"The degree associated edge reconstruction number of bidegreed graphs is at most four","display_name":"The degree associated edge reconstruction number of bidegreed graphs is at most four","publication_year":2025,"publication_date":"2025-03-22","ids":{"openalex":"https://openalex.org/W4408736823","doi":"https://doi.org/10.61091/ars162-02"},"language":"en","primary_location":{"id":"doi:10.61091/ars162-02","is_oa":true,"landing_page_url":"https://doi.org/10.61091/ars162-02","pdf_url":"https://combinatorialpress.com/article/ars/Volume%20162/the-degree-associated-edge-reconstruction-number-of-bidegreed-graphs-is-at-most-four.pdf","source":{"id":"https://openalex.org/S73158690","display_name":"Ars Combinatoria","issn_l":"0381-7032","issn":["0381-7032","2817-5204"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4323439501","host_organization_name":"Charles Babbage Research Centre","host_organization_lineage":["https://openalex.org/P4323439501"],"host_organization_lineage_names":["Charles Babbage Research Centre"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ars Combinatoria","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://combinatorialpress.com/article/ars/Volume%20162/the-degree-associated-edge-reconstruction-number-of-bidegreed-graphs-is-at-most-four.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006755378","display_name":"A. Anu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Anu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020180796","display_name":"S. Monikandan","orcid":"https://orcid.org/0000-0001-9805-2914"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Monikandan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04441129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"162","issue":null,"first_page":"13","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9817000031471252,"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/mathematics","display_name":"Mathematics","score":0.8555686473846436},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.7086054086685181},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5826285481452942},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.4078139662742615},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3722638487815857},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09449043869972229},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07906147837638855}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8555686473846436},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7086054086685181},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5826285481452942},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.4078139662742615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3722638487815857},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09449043869972229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07906147837638855},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.61091/ars162-02","is_oa":true,"landing_page_url":"https://doi.org/10.61091/ars162-02","pdf_url":"https://combinatorialpress.com/article/ars/Volume%20162/the-degree-associated-edge-reconstruction-number-of-bidegreed-graphs-is-at-most-four.pdf","source":{"id":"https://openalex.org/S73158690","display_name":"Ars Combinatoria","issn_l":"0381-7032","issn":["0381-7032","2817-5204"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4323439501","host_organization_name":"Charles Babbage Research Centre","host_organization_lineage":["https://openalex.org/P4323439501"],"host_organization_lineage_names":["Charles Babbage Research Centre"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ars Combinatoria","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.61091/ars162-02","is_oa":true,"landing_page_url":"https://doi.org/10.61091/ars162-02","pdf_url":"https://combinatorialpress.com/article/ars/Volume%20162/the-degree-associated-edge-reconstruction-number-of-bidegreed-graphs-is-at-most-four.pdf","source":{"id":"https://openalex.org/S73158690","display_name":"Ars Combinatoria","issn_l":"0381-7032","issn":["0381-7032","2817-5204"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4323439501","host_organization_name":"Charles Babbage Research Centre","host_organization_lineage":["https://openalex.org/P4323439501"],"host_organization_lineage_names":["Charles Babbage Research Centre"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ars Combinatoria","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323196","display_name":"National Board for Higher Mathematics","ror":"https://ror.org/02m388s04"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4408736823.pdf","grobid_xml":"https://content.openalex.org/works/W4408736823.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2962838298","https://openalex.org/W2600246793"],"abstract_inverted_index":{"The":[0,12],"degree":[1,13,29,91,101],"of":[2,6,18,28,43,60,90,100],"an":[3],"edge":[4,15],"\\(uv\\)":[5],"a":[7,19,58,88],"graph":[8,20],"\\(G\\)":[9,21,81],"is":[10,24,93],"\\(d_G(u)+d_G(v)-2.\\)":[11],"associated":[14,30],"reconstruction":[16],"number":[17,27],"(or":[22],"dern(G))":[23],"the":[25,83],"minimum":[26],"edge-deleted":[31],"subgraphs":[32],"that":[33,64,108],"uniquely":[34],"determines":[35],"\\(G.\\)":[36,118,126],"Graphs":[37],"whose":[38],"vertices":[39,99],"all":[40,77,123],"have":[41],"one":[42],"two":[44,61,98],"possible":[45],"degrees":[46],"\\(d\\)":[47],"and":[48,72],"\\(d+1\\)":[49,92],"are":[50],"called":[51],"\\((d,d+1)\\)-bidegreed":[52,84],"graphs.":[53],"It":[54],"was":[55],"proved,":[56],"in":[57,86],"sequence":[59],"papers":[62],"[1,17],":[63],"\\(dern(mK_{1,3})=4\\)":[65],"for":[66,69,76,113,122],"\\(m>1,\\)":[67],"\\(dern(mK_{2,3})=dern(rP_3)=3\\)":[68],"\\(m>0,":[70],"~r>1\\)":[71],"\\(dern(G)=1\\)":[73],"or":[74,111],"\\(2\\)":[75,112],"other":[78],"bidegreed":[79,116,124],"graphs":[80,85,117,125],"except":[82],"which":[87],"vertex":[89],"adjacent":[94],"to":[95],"at":[96],"least":[97],"\\(d.\\)":[102],"In":[103],"this":[104,114],"paper,":[105],"we":[106],"prove":[107],"\\(dern(G)=":[109],"1\\)":[110],"exceptional":[115],"Thus,":[119],"\\(dern(G)\\leq":[120],"4\\)":[121]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-03-23T00:00:00"}