{"id":"https://openalex.org/W6889495669","doi":"https://doi.org/10.25596/jalc-2022-259","title":"Degree Associated Edge Reconstruction Parameters of Strong Double Brooms","display_name":"Degree Associated Edge Reconstruction Parameters of Strong Double Brooms","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W6889495669","doi":"https://doi.org/10.25596/jalc-2022-259"},"language":"en","primary_location":{"id":"doi:10.25596/jalc-2022-259","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2022-259","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2022-259","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Devi, P. Anusha","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Devi, P. Anusha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Monikandan, S.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Monikandan, S.","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":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26038245,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.711899995803833,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.711899995803833,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.14380000531673431,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.06499999761581421,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5640000104904175},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4909000098705292},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4860999882221222},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.44029998779296875},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.41029998660087585},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.34380000829696655},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.2915000021457672},{"id":"https://openalex.org/keywords/multiple-edges","display_name":"Multiple edges","score":0.2773999869823456}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8226000070571899},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7583000063896179},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5640000104904175},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4909000098705292},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4860999882221222},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.44029998779296875},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.41029998660087585},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38530001044273376},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.34380000829696655},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C103257674","wikidata":"https://www.wikidata.org/wiki/Q6934937","display_name":"Multiple edges","level":3,"score":0.2773999869823456},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C80763892","wikidata":"https://www.wikidata.org/wiki/Q958394","display_name":"Hypercube graph","level":5,"score":0.2727000117301941},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.26489999890327454},{"id":"https://openalex.org/C2776870854","wikidata":"https://www.wikidata.org/wiki/Q172833","display_name":"Broom","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.26260000467300415},{"id":"https://openalex.org/C121134508","wikidata":"https://www.wikidata.org/wiki/Q4949882","display_name":"Bound graph","level":5,"score":0.25859999656677246},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.25540000200271606},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.2540999948978424}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.25596/jalc-2022-259","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2022-259","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.25596/jalc-2022-259","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2022-259","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"An":[0],"edge":[1,20,28,55],"deleted":[2,19],"unlabeled":[3],"subgraph":[4],"of":[5,17,31,39,43,45,58,72,75,96,142,153,170],"a":[6,32,59,94],"graph":[7,33,60,86],"$G$":[8,46,76],"is":[9,36,63,84,120,157,166],"an":[10],"ecard.":[11,24],"A":[12,80],"da-ecard":[13],"specifies":[14],"the":[15,18,23,37,40,64,85,121,130,171,179],"degree":[16,26,53],"along":[21],"with":[22,104,125,136],"The":[25,51],"associated":[27,54],"reconstruction":[29,56],"number":[30,57,66],"$G$,":[34,61],"$\\dern(G)$,":[35],"size":[38],"smallest":[41],"collection":[42,71],"da-ecards":[44,74],"that":[47,69,151],"uniquely":[48,77],"determines":[49,78],"$G$.":[50,79],"adversary":[52],"$\\adern(G)$,":[62],"minimum":[65],"$k$":[67,73,144],"such":[68],"every":[70],"strong":[81,122,154],"double":[82,123,155],"broom":[83,124],"on":[87],"at":[88,113,128],"least":[89,98],"5":[90],"vertices":[91],"obtained":[92],"from":[93],"union":[95],"(at":[97],"two)":[99],"internally":[100,138],"vertex":[101,139],"disjoint":[102,140],"paths":[103,141],"same":[105],"ends":[106,131],"$u$":[107,114,132,146],"and":[108,115,133,135,147,173],"$v$":[109,134],"by":[110],"appending":[111],"leaves":[112,127],"$v$.":[116,148],"In":[117],"particular,":[118],"$B(n,n,mP_{k})$":[119],"$n$":[126],"both":[129],"$m$":[137],"order":[143],"joining":[145],"We":[149,161],"show":[150],"$\\dern$":[152],"brooms":[156],"1":[158,174],"or":[159,175],"2.":[160],"also":[162],"determine":[163],"$\\adern(B(n,n,mP_{k}))$.":[164],"It":[165],"3":[167],"in":[168],"most":[169],"cases":[172],"2":[176],"for":[177,184],"all":[178],"remaining":[180],"cases,":[181],"except":[182],"$\\adern(B(1,1,2P_{k}))=5$":[183],"$k\\geq":[185],"4$.":[186]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}