{"id":"https://openalex.org/W4361278763","doi":"https://doi.org/10.1080/09728600.2023.2184288","title":"Hop total Roman domination in graphs","display_name":"Hop total Roman domination in graphs","publication_year":2023,"publication_date":"2023-01-02","ids":{"openalex":"https://openalex.org/W4361278763","doi":"https://doi.org/10.1080/09728600.2023.2184288"},"language":"en","primary_location":{"id":"doi:10.1080/09728600.2023.2184288","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2023.2184288","pdf_url":null,"source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1080/09728600.2023.2184288","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066590366","display_name":"H. Abdollahzadeh Ahangar","orcid":"https://orcid.org/0000-0002-0038-8047"},"institutions":[{"id":"https://openalex.org/I84248293","display_name":"Babol Noshirvani University of Technology","ror":"https://ror.org/02zc85170","country_code":"IR","type":"education","lineage":["https://openalex.org/I84248293"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"H. Abdollahzadeh Ahangar","raw_affiliation_strings":["Department of Mathematics, Babol Noshirvani University of Technology, Babol, I.R. Iran"],"raw_orcid":"https://orcid.org/0000-0002-0038-8047","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Babol Noshirvani University of Technology, Babol, I.R. Iran","institution_ids":["https://openalex.org/I84248293"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008747635","display_name":"Mustapha Chellali","orcid":"https://orcid.org/0000-0001-5231-6195"},"institutions":[{"id":"https://openalex.org/I83332908","display_name":"University of Blida","ror":"https://ror.org/03g41pw14","country_code":"DZ","type":"education","lineage":["https://openalex.org/I83332908"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"M. Chellali","raw_affiliation_strings":["LAMDA-RO Laboratory, Department of Mathematics, University of Blida, Blida, Algeria"],"raw_orcid":"https://orcid.org/0000-0001-5231-6195","affiliations":[{"raw_affiliation_string":"LAMDA-RO Laboratory, Department of Mathematics, University of Blida, Blida, Algeria","institution_ids":["https://openalex.org/I83332908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023197041","display_name":"Seyed Mahmoud Sheikholeslami","orcid":"https://orcid.org/0000-0003-2298-4744"},"institutions":[{"id":"https://openalex.org/I51301133","display_name":"Azarbaijan Shahid Madani University","ror":"https://ror.org/05pg2cw06","country_code":"IR","type":"education","lineage":["https://openalex.org/I51301133"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"S. M. Sheikholeslami","raw_affiliation_strings":["Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. Iran"],"raw_orcid":"https://orcid.org/0000-0003-2298-4744","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. Iran","institution_ids":["https://openalex.org/I51301133"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080730298","display_name":"M. Soroudi","orcid":"https://orcid.org/0000-0002-6677-6835"},"institutions":[{"id":"https://openalex.org/I51301133","display_name":"Azarbaijan Shahid Madani University","ror":"https://ror.org/05pg2cw06","country_code":"IR","type":"education","lineage":["https://openalex.org/I51301133"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Soroudi","raw_affiliation_strings":["Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. Iran"],"raw_orcid":"https://orcid.org/0000-0002-6677-6835","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. Iran","institution_ids":["https://openalex.org/I51301133"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5066590366"],"corresponding_institution_ids":["https://openalex.org/I84248293"],"apc_list":{"value":1000,"currency":"GBP","value_usd":1226},"apc_paid":{"value":1000,"currency":"GBP","value_usd":1226},"fwci":0.3705,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61566121,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"20","issue":"1","first_page":"73","last_page":"78"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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.9311000108718872,"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/combinatorics","display_name":"Combinatorics","score":0.8761454224586487},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7952712774276733},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.7864963412284851},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6785792708396912},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.6697840690612793},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5510290265083313},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4811345636844635},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.45719021558761597},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4179033041000366},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33142077922821045},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.0858825147151947}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8761454224586487},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7952712774276733},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.7864963412284851},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6785792708396912},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.6697840690612793},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5510290265083313},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4811345636844635},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.45719021558761597},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4179033041000366},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33142077922821045},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0858825147151947},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/09728600.2023.2184288","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2023.2184288","pdf_url":null,"source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:55042796e9fa4f6b9e66af0659a62c77","is_oa":true,"landing_page_url":"https://doaj.org/article/55042796e9fa4f6b9e66af0659a62c77","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 1, Pp 73-78 (2023)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1080/09728600.2023.2184288","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2023.2184288","pdf_url":null,"source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6899999976158142,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W1984228559","https://openalex.org/W2618144827"],"related_works":["https://openalex.org/W2471372608","https://openalex.org/W2489339695","https://openalex.org/W2949735222","https://openalex.org/W4300919538","https://openalex.org/W4299570239","https://openalex.org/W2048253143","https://openalex.org/W1979242696","https://openalex.org/W2167462019","https://openalex.org/W2114815253","https://openalex.org/W1581957840"],"abstract_inverted_index":{"In":[0],"this":[1],"article,":[2],"we":[3,115,135,147,159],"initiate":[4],"a":[5,15,23,27,42],"study":[6],"of":[7,72,78,97,140,153,166],"hop":[8,16,87,108,124,176],"total":[9,17,88,109,125,177],"Roman":[10,18,89,110,126],"domination":[11,90,111,127,178],"defined":[12],"as":[13],"follows:":[14],"dominating":[19],"function":[20,28,80],"(HTRDF)":[21],"on":[22,100,106],"graph":[24],"G=(V,E)":[25],"is":[26,75,129,174],"f:V\u2192{0,1,2}":[29],"such":[30],"that":[31,117,161],"for":[32,131,142,162],"every":[33,163],"vertex":[34,43],"u":[35,49],"with":[36,50,156],"f(u)":[37],"=":[38,52],"0":[39],"there":[40],"exists":[41],"v":[44],"at":[45,168],"distance":[46],"2":[47,53],"from":[48],"f(v)":[51],"and":[54,85,134,144],"the":[55,59,76,86,94,107,118,123,137,175],"subgraph":[56],"induced":[57],"by":[58],"vertices":[60],"assigned":[61],"non-zero":[62],"values":[63,81],"under":[64],"f":[65],"has":[66],"no":[67],"isolated":[68],"vertices.":[69],"The":[70],"weight":[71,96],"an":[73,98],"HTRDF":[74,99],"sum":[77],"its":[79],"over":[82],"all":[83,149],"vertices,":[84],"number":[91],"\u03b3dtR(G)":[92],"equals":[93],"minimum":[95],"G.":[101],"We":[102],"provide":[103],"several":[104],"properties":[105],"number.":[112,179],"More":[113],"precisely,":[114],"show":[116,160],"decision":[119],"problem":[120,128],"corresponding":[121],"to":[122],"NP-complete":[130],"bipartite":[132],"graphs,":[133],"determine":[136],"exact":[138],"value":[139],"\u03b3htR(G)":[141],"paths":[143],"cycles.":[145],"Moreover,":[146],"characterize":[148],"connected":[150],"graphs":[151],"G":[152],"order":[154],"n":[155],"\u03b3htR(G)\u2208{2,3,4,n}.":[157],"Finally,":[158],"tree":[164],"T":[165],"diameter":[167],"least":[169],"3,":[170],"\u03b3htR(T)\u2265\u03b3ht(T)+2,":[171],"where":[172],"\u03b3ht(T)":[173]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-06-15T08:34:33.830935","created_date":"2025-10-10T00:00:00"}