{"id":"https://openalex.org/W7133324343","doi":"https://doi.org/10.48550/arxiv.2603.00304","title":"Burning rooted graph products","display_name":"Burning rooted graph products","publication_year":2026,"publication_date":"2026-02-27","ids":{"openalex":"https://openalex.org/W7133324343","doi":"https://doi.org/10.48550/arxiv.2603.00304"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.00304","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00304","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.00304","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032483801","display_name":"John Peca-Medlin","orcid":"https://orcid.org/0000-0002-3215-6531"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peca-Medlin, John","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032483801"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.490200012922287,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.490200012922287,"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.11569999903440475,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.09019999951124191,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5426999926567078},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5242999792098999},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5037999749183655},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4429999887943268},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3495999872684479},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.3377000093460083},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.32589998841285706}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7077999711036682},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6592000126838684},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5426999926567078},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5242999792098999},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5037999749183655},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48030000925064087},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4429999887943268},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3495999872684479},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.3377000093460083},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.32589998841285706},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2757999897003174},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C80763892","wikidata":"https://www.wikidata.org/wiki/Q958394","display_name":"Hypercube graph","level":5,"score":0.259799987077713},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.25450000166893005},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.2542000114917755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.00304","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00304","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.00304","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00304","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"burning":[1,181],"number":[2,11,182],"$b(G)$":[3],"of":[4,12,46,108,129,179],"a":[5,50,57,94,122,130,155],"graph":[6,80,113,137],"$G$":[7],"is":[8,203,212],"the":[9,44,72,166,175,191,196,218],"minimum":[10],"rounds":[13],"required":[14],"to":[15,27,97,126],"burn":[16],"all":[17,170],"vertices":[18,29,83],"when,":[19],"at":[20,37,88],"each":[21,127],"discrete":[22],"step,":[23],"existing":[24],"fires":[25],"spread":[26],"neighboring":[28],"and":[30,52,62,102,173],"one":[31],"new":[32],"fire":[33],"may":[34],"be":[35,85,98],"ignited":[36],"an":[38,207],"unburned":[39],"vertex.":[40],"This":[41],"parameter":[42,185],"measures":[43],"speed":[45],"influence":[47],"propagation":[48],"in":[49,65,87,183,190],"network":[51],"has":[53],"been":[54],"studied":[55],"as":[56],"model":[58,157],"for":[59,100,104,158,169,199],"information":[60],"diffusion":[61],"resource":[63],"allocation":[64],"distributed":[66],"systems.":[67],"A":[68],"central":[69],"open":[70],"problem,":[71],"Burning":[73],"Number":[74],"Conjecture":[75],"(BNC),":[76],"asserts":[77],"that":[78,165,194,211],"every":[79,184],"on":[81,116,206,217],"$n$":[82],"can":[84],"burned":[86],"most":[89],"$\\lceil":[90],"\\sqrt":[91],"n\\rceil$":[92],"rounds,":[93],"bound":[95],"known":[96,197],"sharp":[99],"paths":[101],"verified":[103],"several":[105],"structured":[106],"families":[107],"trees.":[109],"We":[110,163],"investigate":[111],"rooted":[112,139],"products,":[114,138],"focusing":[115],"comb":[117,171],"graphs":[118,172],"obtained":[119],"by":[120],"attaching":[121],"path":[123,131],"(a":[124],"``tooth'')":[125],"vertex":[128],"(the":[132],"``spine'').":[133],"Unlike":[134],"classical":[135],"symmetric":[136],"products":[140],"introduce":[141],"hierarchical":[142],"bottlenecks:":[143],"communication":[144],"between":[145],"local":[146],"subnetworks":[147],"must":[148],"pass":[149],"through":[150],"designated":[151],"root":[152],"vertices,":[153],"providing":[154],"natural":[156],"hub-and-spoke":[159],"or":[160,214],"chain-of-command":[161],"architectures.":[162],"prove":[164],"BNC":[167],"holds":[168],"determine":[174],"precise":[176],"asymptotic":[177],"order":[178],"their":[180],"regime,":[186],"including":[187],"exact":[188],"formulas":[189],"spine-dominant":[192],"case":[193],"generalize":[195],"formula":[198],"paths.":[200],"Our":[201],"approach":[202],"constructive,":[204],"based":[205],"explicit":[208],"greedy":[209],"algorithm":[210],"optimal":[213],"near-optimal":[215],"depending":[216],"regime.":[219]},"counts_by_year":[],"updated_date":"2026-03-04T07:09:34.246503","created_date":"2026-03-04T00:00:00"}