{"id":"https://openalex.org/W4220715623","doi":"https://doi.org/10.1080/23799927.2022.2059012","title":"Vertex resolvability of convex polytopes with <i>n</i>-paths of length <i>p</i>","display_name":"Vertex resolvability of convex polytopes with <i>n</i>-paths of length <i>p</i>","publication_year":2022,"publication_date":"2022-03-31","ids":{"openalex":"https://openalex.org/W4220715623","doi":"https://doi.org/10.1080/23799927.2022.2059012"},"language":"en","primary_location":{"id":"doi:10.1080/23799927.2022.2059012","is_oa":false,"landing_page_url":"https://doi.org/10.1080/23799927.2022.2059012","pdf_url":null,"source":{"id":"https://openalex.org/S4210234901","display_name":"International Journal of Computer Mathematics Computer Systems Theory","issn_l":"2379-9927","issn":["2379-9927","2379-9935"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics: Computer Systems Theory","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/A5016078817","display_name":"Sahil Sharma","orcid":null},"institutions":[{"id":"https://openalex.org/I59179055","display_name":"Shri Mata Vaishno Devi University","ror":"https://ror.org/036x6w630","country_code":"IN","type":"education","lineage":["https://openalex.org/I59179055"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sahil Sharma","raw_affiliation_strings":["School of Mathematics, Shri Mata Vaishno Devi University, Katra, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, Shri Mata Vaishno Devi University, Katra, India","institution_ids":["https://openalex.org/I59179055"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010265329","display_name":"Vijay Kumar Bhat","orcid":"https://orcid.org/0000-0001-8423-9067"},"institutions":[{"id":"https://openalex.org/I59179055","display_name":"Shri Mata Vaishno Devi University","ror":"https://ror.org/036x6w630","country_code":"IN","type":"education","lineage":["https://openalex.org/I59179055"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Vijay Kumar Bhat","raw_affiliation_strings":["School of Mathematics, Shri Mata Vaishno Devi University, Katra, India"],"raw_orcid":"https://orcid.org/0000-0001-8423-9067","affiliations":[{"raw_affiliation_string":"School of Mathematics, Shri Mata Vaishno Devi University, Katra, India","institution_ids":["https://openalex.org/I59179055"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5010265329"],"corresponding_institution_ids":["https://openalex.org/I59179055"],"apc_list":null,"apc_paid":null,"fwci":0.4525,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63913028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"7","issue":"2","first_page":"129","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":1.0,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":1.0,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9061999917030334,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8869726657867432},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7357471585273743},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.6805878281593323},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5377016663551331},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5366788506507874},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40700584650039673},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37587112188339233},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11152458190917969},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.0709308385848999}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8869726657867432},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7357471585273743},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.6805878281593323},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5377016663551331},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5366788506507874},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40700584650039673},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37587112188339233},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11152458190917969},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0709308385848999}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/23799927.2022.2059012","is_oa":false,"landing_page_url":"https://doi.org/10.1080/23799927.2022.2059012","pdf_url":null,"source":{"id":"https://openalex.org/S4210234901","display_name":"International Journal of Computer Mathematics Computer Systems Theory","issn_l":"2379-9927","issn":["2379-9927","2379-9935"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics: Computer Systems Theory","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":8,"referenced_works":["https://openalex.org/W2026014023","https://openalex.org/W2037298352","https://openalex.org/W2067693312","https://openalex.org/W2105232761","https://openalex.org/W2108442028","https://openalex.org/W2127069466","https://openalex.org/W3043376079","https://openalex.org/W3173642984"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2080136900","https://openalex.org/W2372768926","https://openalex.org/W2999799752","https://openalex.org/W2380497251","https://openalex.org/W4287702462","https://openalex.org/W3046383293","https://openalex.org/W2952817960"],"abstract_inverted_index":{"Let":[0],"G=(V,E)":[1],"be":[2,37],"a":[3,38,53,65],"simple,":[4],"connected,":[5],"and":[6,27,68,101,117,131],"undirected":[7],"graph.":[8],"The":[9],"distance":[10],"between":[11],"two":[12,46,94],"vertices":[13,32,48],"u,v\u2208V,":[14],"denoted":[15,82],"by":[16,83,107,121],"d(u,v),":[17],"is":[18,34,63,75,105,119],"the":[19,22,69,72,77,90,108,122],"length":[20,136],"of":[21,31,71,80,97,110,113,124,135],"shortest":[23],"path":[24],"connecting":[25],"u":[26],"v.":[28],"A":[29,59],"subset":[30],"RG":[33],"said":[35],"to":[36],"resolving":[39,61],"set":[40,62,74],"for":[41,44,93],"G":[42],"if":[43],"any":[45],"distinct":[47],"u1,u2\u2208":[49],"V,":[50],"there":[51],"exist":[52],"vertex":[54],"\u03b1\u2208RG":[55],"such":[56],"that":[57],"d(u1,\u03b1)\u2260d(u2,\u03b1).":[58],"minimal":[60],"called":[64,76],"metric":[66,78,91],"basis,":[67],"cardinality":[70],"basis":[73],"dimension":[79,92],"G,":[81],"\u03b2(G).":[84],"In":[85],"this":[86],"article,":[87],"we":[88],"find":[89],"infinite":[95],"families":[96],"plane":[98],"graphs":[99,115],"\u03a5n":[100,104],"\u03a0n,p,":[102],"where":[103],"obtained":[106,120],"combination":[109,123],"2n":[111],"copies":[112],"bipartite":[114],"(K1,3),":[116],"\u03a0n,p":[118],"double":[125],"antiprism":[126,129],"graph":[127,130],"with":[128],"then":[132],"adding":[133],"n-paths":[134],"p.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}