{"id":"https://openalex.org/W7130615395","doi":"https://doi.org/10.3103/s0146411625700415","title":"Dominating Sets with Neighborhoods for Trees","display_name":"Dominating Sets with Neighborhoods for Trees","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W7130615395","doi":"https://doi.org/10.3103/s0146411625700415"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411625700415","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411625700415","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126401385","display_name":"M. A. Iordanski","orcid":null},"institutions":[{"id":"https://openalex.org/I47410878","display_name":"Nizhny Novgorod State Pedagogical University","ror":"https://ror.org/05mm0yv21","country_code":"RU","type":"education","lineage":["https://openalex.org/I47410878"]},{"id":"https://openalex.org/I79563041","display_name":"N. I. Lobachevsky State University of Nizhny Novgorod","ror":"https://ror.org/01bb1zm18","country_code":"RU","type":"education","lineage":["https://openalex.org/I79563041"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"M. A. Iordanski","raw_affiliation_strings":["Lobachevsky State University of Nizhny Novgorod, Nizhny Novgorod, Russia","Minin Nizhny Novgorod State Pedagogical University, Nizhny Novgorod, Russia"],"affiliations":[{"raw_affiliation_string":"Lobachevsky State University of Nizhny Novgorod, Nizhny Novgorod, Russia","institution_ids":["https://openalex.org/I79563041"]},{"raw_affiliation_string":"Minin Nizhny Novgorod State Pedagogical University, Nizhny Novgorod, Russia","institution_ids":["https://openalex.org/I47410878"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5126401385"],"corresponding_institution_ids":["https://openalex.org/I47410878","https://openalex.org/I79563041"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.79865887,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"59","issue":"7","first_page":"1144","last_page":"1151"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8428999781608582,"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.8428999781608582,"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.03970000147819519,"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/T11476","display_name":"Graph theory and applications","score":0.034699998795986176,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/vertex","display_name":"Vertex (graph theory)","score":0.7062000036239624},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5781999826431274},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5504000186920166},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.5340999960899353},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4316999912261963},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.3853999972343445},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.38260000944137573},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.36079999804496765}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.728600025177002},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7062000036239624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6175000071525574},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5781999826431274},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5504000186920166},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.5340999960899353},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.459199994802475},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4316999912261963},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.3853999972343445},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.38260000944137573},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.36079999804496765},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3495999872684479},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.3327000141143799},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3190999925136566},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.31529998779296875},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3001999855041504},{"id":"https://openalex.org/C80763892","wikidata":"https://www.wikidata.org/wiki/Q958394","display_name":"Hypercube graph","level":5,"score":0.2969000041484833},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.2838999927043915},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2660999894142151},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3103/s0146411625700415","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411625700415","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1974110893","https://openalex.org/W2008628501","https://openalex.org/W2042876290","https://openalex.org/W2539118086","https://openalex.org/W2558532304","https://openalex.org/W2981555160","https://openalex.org/W3109415544","https://openalex.org/W4214483257","https://openalex.org/W4247549312","https://openalex.org/W4389086912","https://openalex.org/W4401466086","https://openalex.org/W4412582169"],"related_works":[],"abstract_inverted_index":{"Subset":[0],"$$V{\\kern":[1],"1pt}":[2,30,38],"'":[3],"\\subset":[4],"V(G)$$":[5],"is":[6,33,61,110],"called":[7],"a":[8],"$$\\varepsilon":[9,20,69,90],"$$":[10,21,56,70,135,195],"-dominating":[11,71],"set":[12],"of":[13,15,44,64,104,118,122,127,139,154,180,184],"vertices":[14,50,65,130,185],"graph":[16],"$$G$$":[17],"with":[18],"neighborhood":[19],"if":[22],"for":[23,78,89,150,173],"any":[24],"vertex":[25,34],"$$v":[26],"\\in":[27,36,142,188],"V\\backslash":[28],"V{\\kern":[29,37],"'$$":[31,39],"there":[32],"$$u":[35],"such":[40],"that":[41],"the":[42,45,62,67,93,102,152,159,181],"length":[43],"shortest":[46],"path":[47],"connecting":[48],"these":[49],"$$~d\\left(":[51],"{u,v{\\;}}":[52],"\\right)~\\,\\,":[53],"\\leqslant":[54,82,84,162],"\\,\\,\\varepsilon":[55],";":[57,88],"$${{\\delta":[58,73,95,105,155,174],"}_{\\varepsilon":[59,74,96,156,175],"}}(G)$$":[60],"number":[63,183],"in":[66,158,186],"minimal":[68],"set;":[72],"}}(G)":[75,97],"=":[76,107],"1$$":[77,99],"$$~r\\left(":[79],"G":[80,86],"\\right)~~~":[81],"\\varepsilon":[83,163],"d\\left(":[85],"\\right)$$":[87,167],"<":[91,164],"r(G)$$":[92],"numbers":[94],">":[98],",":[100],"but":[101],"calculation":[103],"}_{1}}(G)":[106],"\\delta":[108],"(G)$$":[109],"an":[111],"NP\u2011complete":[112],"problem.":[113],"This":[114],"paper":[115],"considers":[116],"class":[117],"trees":[119,140],"$$t_{d}^{\\rho":[120],"}$$":[121,144,190],"diameter":[123],"$$d$$":[124],"whose":[125],"degrees":[126],"all":[128],"internal":[129],"are":[131,145,148,171,199],"equal":[132],"to":[133],"$$\\rho":[134],".":[136,168,196],"Constructive":[137],"descriptions":[138],"$$t":[141,187],"t_{d}^{\\rho":[143,189],"given.":[146,200],"Procedures":[147],"developed":[149],"computing":[151],"values":[153],"}}(t)$$":[157,176],"range":[160],"$$~~1":[161],"r\\left(":[165],"t":[166],"Asymptotic":[169],"estimates":[170],"established":[172],"and":[177],"their":[178],"proportion":[179],"total":[182],"as":[191],"$$d":[192],"\\to":[193],"\\infty":[194],"Computational":[197],"examples":[198]},"counts_by_year":[],"updated_date":"2026-02-20T17:44:18.066148","created_date":"2026-02-20T00:00:00"}