{"id":"https://openalex.org/W7161938479","doi":"https://doi.org/10.48550/arxiv.2605.20970","title":"On the Complexity of Hop Domination and 2-Step Domination in Graph Classes","display_name":"On the Complexity of Hop Domination and 2-Step Domination in Graph Classes","publication_year":2026,"publication_date":"2026-05-20","ids":{"openalex":"https://openalex.org/W7161938479","doi":"https://doi.org/10.48550/arxiv.2605.20970"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.20970","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.20970","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.20970","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136635447","display_name":"Sandip Das","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Das, Sandip","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126690434","display_name":"Sweta Das","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Das, Sweta","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136636011","display_name":"Sk Samim Islam","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Islam, Sk Samim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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/T10374","display_name":"Advanced Graph Theory Research","score":0.97079998254776,"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.97079998254776,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.008799999952316284,"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.0031999999191612005,"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/dominating-set","display_name":"Dominating set","score":0.7609000205993652},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6865000128746033},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.6087999939918518},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.4982999861240387},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4499000012874603},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.3458999991416931},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.3425000011920929},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.33660000562667847}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8011000156402588},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7609000205993652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.70660001039505},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6865000128746033},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.6087999939918518},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.4982999861240387},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48539999127388},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4499000012874603},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.3458999991416931},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3425000011920929},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.33660000562667847},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.32440000772476196},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.30799999833106995},{"id":"https://openalex.org/C121134508","wikidata":"https://www.wikidata.org/wiki/Q4949882","display_name":"Bound graph","level":5,"score":0.3057999908924103},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2955999970436096},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.29350000619888306},{"id":"https://openalex.org/C82190004","wikidata":"https://www.wikidata.org/wiki/Q5121633","display_name":"Circulant graph","level":5,"score":0.2896000146865845},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.25870001316070557},{"id":"https://openalex.org/C73380178","wikidata":"https://www.wikidata.org/wiki/Q8024306","display_name":"Windmill graph","level":5,"score":0.25850000977516174}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.20970","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.20970","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.20970","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.20970","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"The":[0,128],"domination":[1,20,25,146,151],"problem":[2,6,21,132],"is":[3,49,103],"a":[4,30,41,44,95,98,116,141,144,149],"well-studied":[5],"in":[7,59,72,84,126],"graph":[8,31,42,96,142],"theory.":[9],"In":[10],"this":[11],"paper,":[12],"we":[13],"study":[14,160],"two":[15],"natural":[16],"variants:":[17],"the":[18,23,80,134,161],"hop":[19,145],"and":[22,36,133,167,185],"$2$-step":[24,150],"problem.":[26],"Let":[27],"$G$":[28],"be":[29],"with":[32],"vertex":[33,57,71,111,125],"set":[34,38,81,147,152],"$V$":[35],"edge":[37],"$E$.":[39],"For":[40,74,94],"$G$,":[43,97],"subset":[45,99],"$S":[46,100],"\\subseteq":[47,101],"V(G)$":[48,102,113],"called":[50,104],"an":[51,105],"\\emph{hop":[52],"dominating":[53,107],"set}":[54,108],"if":[55,109],"every":[56,110,180],"not":[58],"$S$":[60],"lies":[61,114],"at":[62,68,88,115,122,155],"distance":[63,89,117],"of":[64,82,118,153,164],"exactly":[65,90,119],"$2$":[66,91,120],"from":[67,92,121],"least":[69,123],"one":[70,124],"$S$.":[73,127],"$v\\in":[75,112],"V(G)$,":[76],"let":[77],"$N(v,2)$":[78],"denote":[79],"vertices":[83],"$V(G)$":[85],"that":[86,169],"are":[87,171],"$v$.":[93],"\\emph{$2$-step":[106],"\\textsc{Hop":[129],"Domination}":[130,136],"(HD)":[131],"\\textsc{$2$-Step":[135],"($2$SD)":[137],"problems":[138],"ask":[139],"whether":[140],"contains":[143],"or":[148],"size":[154],"most":[156],"$k$,":[157],"respectively.":[158],"We":[159],"computational":[162],"complexity":[163],"these":[165],"problems,":[166],"show":[168],"both":[170],"NP-complete,":[172],"even":[173],"when":[174],"restricted":[175],"to":[176],"$d$-regular":[177],"graphs":[178,184],"for":[179],"$d\\geq":[181],"3$,":[182],"claw-free":[183],"also":[186],"unit":[187],"disk":[188],"graphs.":[189]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-22T00:00:00"}