{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:25:25Z","timestamp":1776439525838,"version":"3.51.2"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319037790","type":"print"},{"value":"9783319037806","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_8","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T01:13:18Z","timestamp":1384996398000},"page":"84-95","source":"Crossref","is-referenced-by-count":18,"title":["The Fractional Strong Metric Dimension of Graphs"],"prefix":"10.1007","author":[{"given":"Cong X.","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eunjeong","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"1584","DOI":"10.1016\/j.disc.2011.05.039","volume":"312","author":"S. Arumugam","year":"2012","unstructured":"Arumugam, S., Mathew, V.: The fractional metric dimension of graphs. Discrete Math.\u00a0312, 1584\u20131590 (2012)","journal-title":"Discrete Math."},{"key":"8_CR2","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, E., Johnson, M.A., Oellermann, O.R.: Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math.\u00a0105, 99\u2013113 (2000)","journal-title":"Discrete Appl. Math."},{"key":"8_CR3","first-page":"157","volume":"39","author":"J. Currie","year":"2001","unstructured":"Currie, J., Oellermann, O.R.: The metric dimension and metric independence of a graph. J. Combin. Math. Combin. Comput.\u00a039, 157\u2013167 (2001)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.disc.2005.09.015","volume":"306","author":"M. Fehr","year":"2006","unstructured":"Fehr, M., Gosselin, S., Oellermann, O.R.: The metric dimension of Cayley digraphs. Discrete Math.\u00a0306, 31\u201341 (2006)","journal-title":"Discrete Math."},{"key":"8_CR5","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, New York (1979)"},{"key":"8_CR6","first-page":"191","volume":"2","author":"F. Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combin.\u00a02, 191\u2013195 (1976)","journal-title":"Ars Combin."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Holton, D.A., Sheehan, J.: The Petersen graph. Cambridge University Press (1993)","DOI":"10.1017\/CBO9780511662058"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discrete Appl. Math.\u00a070, 217\u2013229 (1996)","journal-title":"Discrete Appl. Math."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.2307\/2306658","volume":"63","author":"E.A. Nordhaus","year":"1956","unstructured":"Nordhaus, E.A., Gaddum, J.W.: On complementary graphs. Amer. Math. Monthly\u00a063, 175\u2013177 (1956)","journal-title":"Amer. Math. Monthly"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.dam.2006.06.009","volume":"155","author":"O.R. Oellermann","year":"2007","unstructured":"Oellermann, O.R., Peters-Fransen, J.: The strong metric dimension of graphs and digraphs. Discrete Appl. Math.\u00a0155, 356\u2013364 (2007)","journal-title":"Discrete Appl. Math."},{"key":"8_CR11","volume-title":"Fractal graph theory: A rational approach to the theory of graphs","author":"E.R. Scheinerman","year":"1997","unstructured":"Scheinerman, E.R., Ullman, D.H.: Fractal graph theory: A rational approach to the theory of graphs. John Wiley & Sons, New York (1997)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/moor.1030.0070","volume":"29","author":"A. Seb\u00f6","year":"2004","unstructured":"Seb\u00f6, A., Tannier, E.: On metric generators of graphs. Math. Oper. Res.\u00a029, 383\u2013393 (2004)","journal-title":"Math. Oper. Res."},{"key":"8_CR13","first-page":"549","volume":"14","author":"P.J. Slater","year":"1975","unstructured":"Slater, P.J.: Leaves of trees. Congress. Numer.\u00a014, 549\u2013559 (1975)","journal-title":"Congress. Numer."},{"key":"8_CR14","unstructured":"Yi, E.: The fractional metric dimension of permutation graphs (submitted)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:57:03Z","timestamp":1558688223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}