{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:57:27Z","timestamp":1743069447660,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031834370"},{"type":"electronic","value":"9783031834387"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-83438-7_15","type":"book-chapter","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:26Z","timestamp":1738706186000},"page":"173-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On a\u00a0Tight Bound for\u00a0the\u00a0Maximum Number of\u00a0Vertices that\u00a0Belong to\u00a0Every Metric Basis"],"prefix":"10.1007","author":[{"given":"Anni","family":"Hakanen","sequence":"first","affiliation":[]},{"given":"Ville","family":"Junnila","sequence":"additional","affiliation":[]},{"given":"Tero","family":"Laihonen","sequence":"additional","affiliation":[]},{"given":"Havu","family":"Miikonen","sequence":"additional","affiliation":[]},{"given":"Ismael\u00a0G.","family":"Yero","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"key":"15_CR1","first-page":"249","volume":"129","author":"BB Gh","year":"2016","unstructured":"Gh, B.B., Jannesari, M., Omoomi, B.: Unique basis graphs. Ars Comb. 129, 249\u2013259 (2016)","journal-title":"Ars Comb."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1025745406160","volume":"46","author":"PS Buczkowski","year":"2003","unstructured":"Buczkowski, P.S., Chartrand, G., Poisson, C., Zhang, P.: On k-dimensional graphs and their bases. Period. Math. Hung. 46, 9\u201315 (2003). https:\/\/doi.org\/10.1023\/A:1025745406160","journal-title":"Period. Math. Hung."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","volume":"105","author":"G Chartrand","year":"2000","unstructured":"Chartrand, G., Eroh, L., Johnson, M.A., Oellermann, O.R.: Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105, 99\u2013113 (2000). https:\/\/doi.org\/10.1016\/S0166-218X(00)00198-0","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"2603","DOI":"10.1007\/s40840-020-01068-6","volume":"44","author":"M Claverol","year":"2021","unstructured":"Claverol, M., et al.: Metric dimension of maximal outerplanar graphs. Bull. Malays. Math. Sci. Soc. 44(4), 2603\u20132630 (2021). https:\/\/doi.org\/10.1007\/s40840-020-01068-6","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Foster-Greenwood, B., Uhl, Ch.: Metric dimension of a direct product of three complete graphs. Electron. J. Combin. 31, Paper No. 2.13 (2024). https:\/\/doi.org\/10.37236\/12399","DOI":"10.37236\/12399"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.tcs.2019.02.013","volume":"806","author":"A Hakanen","year":"2020","unstructured":"Hakanen, A., Junnila, V., Laihonen, T.: The solid-metric dimension. Theor. Comput. Sci. 806, 156\u2013170 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.02.013","journal-title":"Theor. Comput. Sci."},{"key":"15_CR7","unstructured":"Hakanen, A., Junnila, V., Laihonen, T., Miikonen, H., Yero, I.G.: On the Maximum Number of Vertices that Belong to Every Metric Basis (in preparation)"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.7151\/dmgt.2367","volume":"43","author":"A Hakanen","year":"2023","unstructured":"Hakanen, A., Junnila, V., Laihonen, T., Puertas, M.L.: On the metric dimensions for sets of vertices. Discuss. Math. Graph Theory 43(1), 245\u2013275 (2023). https:\/\/doi.org\/10.7151\/dmgt.2367","journal-title":"Discuss. Math. Graph Theory"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.dam.2021.12.004","volume":"319","author":"A Hakanen","year":"2022","unstructured":"Hakanen, A., Junnila, V., Laihonen, T., Yero, I.G.: On vertices contained in all or in no metric basis. Discrete Appl. Math. 319, 407\u2013423 (2022). https:\/\/doi.org\/10.1016\/j.dam.2021.12.004","journal-title":"Discrete Appl. Math."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.dam.2024.04.020","volume":"353","author":"A Hakanen","year":"2024","unstructured":"Hakanen, A., Junnila, V., Laihonen, T., Yero, I.G.: On the unicyclic graphs having vertices that belong to all their (strong) metric bases. Discrete Appl. Math. 353, 191\u2013207 (2024). https:\/\/doi.org\/10.1016\/j.dam.2024.04.020","journal-title":"Discrete Appl. Math."},{"key":"15_CR11","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.: On the metric dimension of a graph. Ars Combin. 2, 191\u2013195 (1976)","journal-title":"Ars Combin."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.dam.2018.09.034","volume":"263","author":"C Hernando","year":"2019","unstructured":"Hernando, C., Mora, M., Pelayo, I.M.: Locating domination in bipartite graphs and their complements. Discrete Appl. Math. 263, 195\u2013203 (2019). https:\/\/doi.org\/10.1016\/j.dam.2018.09.034","journal-title":"Discrete Appl. Math."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2022.02.014","volume":"316","author":"S Mashkaria","year":"2022","unstructured":"Mashkaria, S., \u00d3dor, G., Thiran, P.: On the robustness of the metric dimension of grid graphs to adding a single edge. Discrete Appl. Math. 316, 1\u201327 (2022). https:\/\/doi.org\/10.1016\/j.dam.2022.02.014","journal-title":"Discrete Appl. Math."},{"key":"15_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125908","volume":"396","author":"J Sedlar","year":"2021","unstructured":"Sedlar, J., \u0160krekovski, R.: Bounds on metric dimensions of graphs with edge disjoint cycles. Appl. Math. Comput. 396, 125908 (2021). https:\/\/doi.org\/10.1016\/j.amc.2020.125908","journal-title":"Appl. Math. Comput."},{"key":"15_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2022.127147","volume":"427","author":"J Sedlar","year":"2022","unstructured":"Sedlar, J., \u0160krekovski, R.: Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two. Appl. Math. Comput. 427, 127147 (2022). https:\/\/doi.org\/10.1016\/j.amc.2022.127147","journal-title":"Appl. Math. Comput."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.dam.2022.02.022","volume":"314","author":"J Sedlar","year":"2022","unstructured":"Sedlar, J., \u0160krekovski, R.: Vertex and edge metric dimensions of unicyclic graphs. Discrete Appl. Math. 314, 81\u201392 (2022). https:\/\/doi.org\/10.1016\/j.dam.2022.02.022","journal-title":"Discrete Appl. Math."},{"key":"15_CR17","first-page":"549","volume":"14","author":"PJ Slater","year":"1975","unstructured":"Slater, P.J.: Leaves of trees. Congr. Numer. 14, 549\u2013559 (1975)","journal-title":"Congr. Numer."},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00285-019-01348-1","volume":"79","author":"RC Tillquist","year":"2019","unstructured":"Tillquist, R.C., Lladser, M.E.: Low-dimensional representation of genomic sequences. J. Math. Biol. 79(1), 1\u201329 (2019). https:\/\/doi.org\/10.1007\/s00285-019-01348-1","journal-title":"J. Math. Biol."},{"issue":"4","key":"15_CR19","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1137\/21M1409512","volume":"65","author":"RC Tillquist","year":"2023","unstructured":"Tillquist, R.C., Frongillo, R.M., Lladser, M.E.: Getting the lay of the land in discrete space: a survey of metric dimension and its applications. SIAM Rev. 65(4), 919\u2013962 (2023). https:\/\/doi.org\/10.1137\/21M1409512","journal-title":"SIAM Rev."},{"key":"15_CR20","doi-asserted-by":"publisher","unstructured":"Wang, J., Tian, F., Liu, Y., Pang, J., Miao, L.: On graphs of order $$n$$ with metric dimension $$n-4$$. Graphs Combin. 39, Paper No. 29 (2023). https:\/\/doi.org\/10.1007\/s00373-023-02627-x","DOI":"10.1007\/s00373-023-02627-x"},{"key":"15_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2022.127350","volume":"432","author":"J Wu","year":"2022","unstructured":"Wu, J., Wang, L., Yang, W.: Learning to compute the metric dimension of graphs. Appl. Math. Comput. 432, 127350 (2022). https:\/\/doi.org\/10.1016\/j.amc.2022.127350","journal-title":"Appl. Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83438-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:40Z","timestamp":1738706200000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83438-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031834370","9783031834387"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83438-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Coimbatore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam-2025-website.vercel.app\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}