{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:36:49Z","timestamp":1742913409070,"version":"3.40.3"},"publisher-location":"Boston","reference-count":86,"publisher":"Birkh\u00e4user Boston","isbn-type":[{"type":"print","value":"9780817647889"},{"type":"electronic","value":"9780817647896"}],"license":[{"start":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T00:00:00Z","timestamp":1284595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T00:00:00Z","timestamp":1284595200000},"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":[[2011]]},"DOI":"10.1007\/978-0-8176-4789-6_8","type":"book-chapter","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T07:42:50Z","timestamp":1287042170000},"page":"197-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Geodetic Sets in Graphs"],"prefix":"10.1007","author":[{"given":"Bo\u0161tjan","family":"Bre\u0161ar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matja\u017e","family":"Kov\u0161e","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandra","family":"Tepeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,16]]},"reference":[{"key":"8_CR1_8","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1080\/00207160210954","volume":"79","author":"M Atici","year":"2002","unstructured":"Atici M (2002) Computational complexity of geodetic set. Int J Comput Math 79:587\u2013591","journal-title":"Int J Comput Math"},{"key":"8_CR2_8","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s003730200030","volume":"18","author":"M Atici","year":"2002","unstructured":"Atici M, Vince A (2002) Geodesics in graphs, an extremal set problem, and perfect hash families. Graph Combinator 18:403\u2013413","journal-title":"Graph Combinator"},{"issue":"18","key":"8_CR3_8","doi-asserted-by":"publisher","first-page":"3679","DOI":"10.1016\/j.dam.2009.07.007","volume":"157","author":"K Balakrishnan","year":"2009","unstructured":"Balakrishnan K, Bre\u0161ar B, Changat M et al (2009) On the remoteness function in median graphs. Discrete Appl Math 157(18):3679\u20133688","journal-title":"Discrete Appl Math"},{"key":"8_CR4_8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1006\/eujc.1996.0010","volume":"17","author":"H-J Bandelt","year":"1996","unstructured":"Bandelt H-J, Chepoi V (1996) Graphs of acyclic cubical complexes. Eur J Combinator 17: 113\u2013120","journal-title":"Eur J Combinator"},{"key":"8_CR5_8","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1002\/jgt.3190180705","volume":"18","author":"H-J Bandelt","year":"1994","unstructured":"Bandelt H-J, Mulder HM, Wilkeit E (1994) Quasi-median graphs and algebras. J Graph Theory 18:681\u2013703","journal-title":"J Graph Theory"},{"key":"8_CR6_8","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1093\/genetics\/141.2.743","volume":"14","author":"H-J Bandelt","year":"1995","unstructured":"Bandelt H-J, Forster P, Sykes BC, Richards MB (1995) Mitochondrial portraits of human populations using median networks. Genetics 14:743\u2013753","journal-title":"Genetics"},{"key":"8_CR7_8","first-page":"269","volume":"18","author":"H Bielak","year":"1983","unstructured":"Bielak H, Sys\u0142o M (1983) Peripheral vertices in graphs. Studia Sci Math Hungar 18:269\u2013275","journal-title":"Studia Sci Math Hungar"},{"doi-asserted-by":"crossref","unstructured":"Brandes U (2005) Network analysis. Methodological foundations. Lecture Notes in Computer Science, vol 3418. Springer, Berlin, pp 62\u201382","key":"8_CR8_8","DOI":"10.1007\/b106453"},{"key":"8_CR9_8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.7151\/dmgt.1198","volume":"23","author":"B Bre\u0161ar","year":"2003","unstructured":"Bre\u0161ar B (2003) Arboreal structure and regular graphs of median-like classes. Discuss Math Graph Theory 23:215\u2013225","journal-title":"Discuss Math Graph Theory"},{"key":"8_CR10_8","doi-asserted-by":"publisher","first-page":"4044","DOI":"10.1016\/j.disc.2007.07.119","volume":"308","author":"B Bre\u0161ar","year":"2008","unstructured":"Bre\u0161ar B, Tepeh Horvat A (2008) On the geodetic number of median graphs. Discrete Math 308:4044\u20134051","journal-title":"Discrete Math"},{"doi-asserted-by":"crossref","unstructured":"Bre\u0161ar B, Changat M, Subhamathi AR, Tepeh Horvat A (2010) The periphery graph of a median graph. Discuss Math Graph Theory (to appear)","key":"8_CR11_8","DOI":"10.7151\/dmgt.1473"},{"key":"8_CR12_8","doi-asserted-by":"publisher","first-page":"5555","DOI":"10.1016\/j.disc.2007.10.007","volume":"308","author":"B Bre\u0161ar","year":"2008","unstructured":"Bre\u0161ar B, Klav\u017ear S, Tepeh Horvat A (2008) On the geodetic number and related metric sets in Cartesian product graphs. Discrete Math 308:5555\u20135561","journal-title":"Discrete Math"},{"key":"8_CR13_8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1080\/16073606.1985.9631921","volume":"8","author":"F Buckley","year":"1986","unstructured":"Buckley F, Harary F (1986) Geodetic games for graphs. Quaest Math 8:321\u2013334","journal-title":"Quaest Math"},{"key":"8_CR14_8","volume-title":"Distance in graphs","author":"F Buckley","year":"1990","unstructured":"Buckley F, Harary F (1990) Distance in graphs. Addison-Wesley, Redwood City"},{"key":"8_CR15_8","first-page":"17","volume":"2A","author":"F Buckley","year":"1988","unstructured":"Buckley F, Harary F, Quintas LV (1988) Extremal results on the geodetic number of a graph. Scientia 2A:17\u201326","journal-title":"Scientia"},{"key":"8_CR16_8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.endm.2005.05.005","volume":"19","author":"J C\u00e1ceres","year":"2005","unstructured":"C\u00e1ceres J, Hernando C, Mora M, Pelayo IM, Puertas ML, Seara C (2005) Searching for geodetic boundary vertex sets. Electron Notes Discrete Math 19:25\u201331","journal-title":"Electron Notes Discrete Math"},{"key":"8_CR17_8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.disc.2005.03.020","volume":"297","author":"J C\u00e1ceres","year":"2005","unstructured":"C\u00e1ceres J, M\u00e1rquez A, Oellermann OR, Puertas ML (2005) Rebuilding convex sets in graphs. Discrete Math 297:26\u201337","journal-title":"Discrete Math"},{"key":"8_CR18_8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.disc.2005.12.012","volume":"306","author":"J C\u00e1ceres","year":"2006","unstructured":"C\u00e1ceres J, Hernando C, Mora M, Pelayo IM, Puertas ML, Seara C (2006) On geodetic sets formed by boundary vertices. Discrete Math 306:188\u2013198","journal-title":"Discrete Math"},{"key":"8_CR19_8","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1016\/j.dam.2007.05.049","volume":"156","author":"J C\u00e1ceres","year":"2008","unstructured":"C\u00e1ceres J, Hernando C, Mora M, Pelayo IM, Puertas ML, Seara C (2008) Geodecity of the contour of chordal graphs. Discrete Appl Math 156:1132\u20131142","journal-title":"Discrete Appl Math"},{"key":"8_CR20_8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.disc.2004.06.014","volume":"287","author":"GB Cagaanan","year":"2004","unstructured":"Cagaanan GB, Canoy SR (2004) On the hull sets and hull number of the Cartesian product of graphs. Discrete Math 287:141\u2013144","journal-title":"Discrete Math"},{"key":"8_CR21_8","first-page":"33","volume":"79","author":"GB Cagaanan","year":"2006","unstructured":"Cagaanan GB, Canoy SR (2006) On the geodetic covers and geodetic bases of the composition G[K\n                     \n                m\n              ]. Ars Combinatoria 79:33\u201345","journal-title":"Ars Combinatoria"},{"key":"8_CR22_8","first-page":"143","volume":"71","author":"GB Cagaanan","year":"2006","unstructured":"Cagaanan GB, Canoy SR, Gervacio SV (2006) Convexity, geodetic, and hull numbers of the join of graphs. Utilitas Math 71:143\u2013159","journal-title":"Utilitas Math"},{"key":"8_CR23_8","first-page":"11","volume":"26","author":"G Chae","year":"2002","unstructured":"Chae G, Palmer EM, Siu W (2002) Geodetic number of random graphs of diameter 2. Australas J Combinator 26:11\u201320","journal-title":"Australas J Combinator"},{"key":"8_CR24_8","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.ejc.2003.09.010","volume":"25","author":"GJ Chang","year":"2004","unstructured":"Chang GJ, Tong L, Wang H (2004) Geodetic spectra of graphs. Eur J Combinator 25:383\u2013391","journal-title":"Eur J Combinator"},{"doi-asserted-by":"crossref","unstructured":"Chung FRK, Graham RL, Saks ME (1987) Dynamic search in graphs. In: Wilf H","key":"#cr-split#-8_CR25_8.1","DOI":"10.1016\/B978-0-12-386870-1.50026-5"},{"unstructured":"(ed) Discrete algorithms and complexity. Perspectives in Computing (Kyoto, 1986), vol 15. Academic, New York, pp 351-387","key":"#cr-split#-8_CR25_8.2"},{"key":"8_CR26_8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.7151\/dmgt.1084","volume":"19","author":"G Chartrand","year":"1999","unstructured":"Chartrand G, Zhang P (1999) The forcing geodetic number of a graph. Discuss Math Graph Theory 19:45\u201358","journal-title":"Discuss Math Graph Theory"},{"key":"8_CR27_8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1006\/eujc.1999.0301","volume":"21","author":"G Chartrand","year":"2000","unstructured":"Chartrand G, Zhang P (2000) The geodetic number of an oriented graph. Eur J Combinator 21:181\u2013189","journal-title":"Eur J Combinator"},{"key":"8_CR28_8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0012-365X(00)00456-8","volume":"242","author":"G Chartrand","year":"2002","unstructured":"Chartrand G, Zhang P (2002) The Steiner number of a graph. Discrete Math 242:41\u201354","journal-title":"Discrete Math"},{"key":"8_CR29_8","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1023\/B:CMAJ.0000027232.97642.45","volume":"52","author":"G Chartrand","year":"2002","unstructured":"Chartrand G, Zhang P (2002) Extreme geodesic graphs. Czech Math J 52:771\u2013780","journal-title":"Czech Math J"},{"key":"8_CR30_8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.7151\/dmgt.1112","volume":"20","author":"G Chartrand","year":"2000","unstructured":"Chartrand G, Harary F, Zhang P (2000) Geodetic sets in graphs. Discuss Math Graph Theory 20:129\u2013138","journal-title":"Discuss Math Graph Theory"},{"key":"8_CR31_8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.10007","volume":"39","author":"G Chartrand","year":"2002","unstructured":"Chartrand G, Harary F, Zhang P (2002) On the geodetic number of a graph. Networks 39:1\u20136","journal-title":"Networks"},{"key":"8_CR32_8","first-page":"37","volume":"156","author":"G Chartrand","year":"2002","unstructured":"Chartrand G, Palmer EM, Zhang P (2002) The geodetic number of a graph: a survey. Congr Numer 156:37\u201358","journal-title":"Congr Numer"},{"key":"8_CR33_8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0012-365X(02)00567-8","volume":"263","author":"G Chartrand","year":"2003","unstructured":"Chartrand G, Erwin D, Johns GL, Zhang P (2003) Boundary vertices in graphs. Discrete Math 263:25\u201334","journal-title":"Discrete Math"},{"key":"8_CR34_8","doi-asserted-by":"publisher","first-page":"2265","DOI":"10.1155\/S0161171203210577","volume":"36","author":"G Chartrand","year":"2003","unstructured":"Chartrand G, Fink JF, Zhang P (2003) The hull number of an oriented graph. Int J Math Math Sci 36:2265\u20132275","journal-title":"Int J Math Math Sci"},{"key":"8_CR35_8","first-page":"97","volume":"64","author":"G Chartrand","year":"2003","unstructured":"Chartrand G, Johns G, Zhang P (2003) The detour number of a graph. Utilitas Math 64:97\u2013113","journal-title":"Utilitas Math"},{"key":"8_CR36_8","first-page":"39","volume":"48","author":"G Chartrand","year":"2004","unstructured":"Chartrand G, Erwin D, Johns GL, Zhang P (2004) On boundary vertices in graphs. J Combin Math Combin Comput 48:39\u201353","journal-title":"J Combin Math Combin Comput"},{"key":"8_CR37_8","first-page":"3","volume":"72","author":"G Chartrand","year":"2004","unstructured":"Chartrand G, Johns GL, Zhang P (2004) On the detour number and geodetic number of a graph. Ars Combinator 72:3\u201315","journal-title":"Ars Combinator"},{"key":"8_CR38_8","first-page":"75","volume":"53","author":"G Chartrand","year":"2005","unstructured":"Chartrand G, Escuadro H, Zhang P (2005) Detour distance in graphs. J Combin Math Combin Comput 53:75\u201394","journal-title":"J Combin Math Combin Comput"},{"key":"8_CR39_8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith D, Winograd S (1990) Matrix multiplication via arithmetic progressions. J Symbolic Comput 9:251\u2013280","journal-title":"J Symbolic Comput"},{"key":"8_CR40_8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00234-2","volume-title":"Encyclopedia of distances","author":"M Deza","year":"2009","unstructured":"Deza M, Deza E (2009) Encyclopedia of distances. Springer, Berlin Heidelberg"},{"key":"8_CR41_8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0095-8956(73)90010-5","volume":"14","author":"D Djokovi\u0107","year":"1973","unstructured":"Djokovi\u0107 D (1973) Distance preserving subgraphs of hypercubes. J Combin Theory B 14: 263\u2013267","journal-title":"J Combin Theory B"},{"key":"8_CR42_8","first-page":"113","volume":"107","author":"AL Douthat","year":"1995","unstructured":"Douthat AL, Kong MC (1995) Computing the geodetic number of bipartite graphs. Congr Numer 107:113\u2013119","journal-title":"Congr Numer"},{"key":"8_CR43_8","first-page":"67","volume":"22","author":"AL Douthat","year":"1996","unstructured":"Douthat AL, Kong MC (1996) Computing geodetic bases of chordal and split graphs. J Combin Math Combin Comput 22:67\u201378","journal-title":"J Combin Math Combin Comput"},{"key":"8_CR44_8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0095-8956(88)90039-1","volume":"44","author":"P Duchet","year":"1988","unstructured":"Duchet P (1988) Convex sets in graphs II. Minimal path convexity. J Combin Theory B 44: 307\u2013316","journal-title":"Minimal path convexity. J Combin Theory B"},{"key":"8_CR45_8","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/j.ejc.2004.05.001","volume":"26","author":"D Eppstein","year":"2005","unstructured":"Eppstein D (2005) The lattice dimension of a graph. Eur J Combinator 26:585\u2013592","journal-title":"Eur J Combinator"},{"key":"8_CR46_8","doi-asserted-by":"publisher","first-page":"4212","DOI":"10.1016\/j.disc.2007.08.052","volume":"308","author":"L Eroh","year":"2008","unstructured":"Eroh L, Oellermann OR (2008) Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs. Discrete Math 308:4212\u20134220","journal-title":"Discrete Math"},{"key":"8_CR47_8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0012-365X(85)90174-8","volume":"57","author":"MG Everett","year":"1985","unstructured":"Everett MG, Seidman SB (1985) The hull number of a graph. Discrete Math 57:217\u2013223","journal-title":"Discrete Math"},{"key":"8_CR48_8","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/0607049","volume":"7","author":"M Farber","year":"1986","unstructured":"Farber M, Jamison RE (1986) Convexity in graphs and hypergraphs. SIAM J Algebraic Discrete Math 7:433\u2013444","journal-title":"SIAM J Algebraic Discrete Math"},{"key":"8_CR49_8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.dam.2005.03.002","volume":"148","author":"A Farrugia","year":"2005","unstructured":"Farrugia A (2005) Orientable convexity, geodetic and hull numbers in graphs. Discrete Appl Math 148:256\u2013262","journal-title":"Discrete Appl Math"},{"key":"8_CR50_8","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01254296","volume":"18","author":"AS Fraenkel","year":"1989","unstructured":"Fraenkel AS, Harary F (1989) Geodetic contraction games on graphs. Int J Game Theory 18:327\u2013338","journal-title":"Int J Game Theory"},{"key":"8_CR51_8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s11590-006-0032-3","volume":"1","author":"P Hansen","year":"2007","unstructured":"Hansen P, van Omme N (2007) On pitfalls in computing the geodetic number of a graph. Opt Lett 1:299\u2013307","journal-title":"Opt Lett"},{"key":"8_CR52_8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0895-7177(93)90259-2","volume":"17","author":"F Harary","year":"1993","unstructured":"Harary F, Loukakis E, Tsouros C (1993) The geodetic number of a graph. Math Comput Model 17:89\u201395","journal-title":"Math Comput Model"},{"key":"8_CR53_8","doi-asserted-by":"crossref","first-page":"389","DOI":"10.2989\/16073600309486069","volume":"26","author":"TW Haynes","year":"2003","unstructured":"Haynes TW, Henning MA, Tiller C (2003) Geodetic achievement and avoidance games for graphs. Quaest Math 26:389\u2013397","journal-title":"Quaest Math"},{"key":"8_CR54_8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.disc.2004.08.039","volume":"293","author":"C Hernando","year":"2005","unstructured":"Hernando C, Jiang T, Mora M, Pelayo I, Seara C (2005) On the Steiner, geodetic and hull numbers of graphs. Discrete Math 293:139\u2013154","journal-title":"Discrete Math"},{"key":"8_CR55_8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.endm.2006.06.036","volume":"24","author":"C Hernando","year":"2006","unstructured":"Hernando C, Mora M, Pelayo I, Seara C (2006) Some structural, metric and convex properties on the boundary of a graph. Electron Notes Discrete Math 24:203\u2013209","journal-title":"Electron Notes Discrete Math"},{"unstructured":"Hernando C, Mora M, Pelayo I, Seara C On monophonic sets in graphs. Manuscript","key":"8_CR56_8"},{"key":"8_CR57_8","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E Howorka","year":"1977","unstructured":"Howorka E (1977) A characterization of distance hereditary graphs. Q J Math Oxford, 28: 417\u2013420","journal-title":"Q J Math Oxford"},{"key":"8_CR58_8","doi-asserted-by":"publisher","first-page":"2134","DOI":"10.1016\/j.disc.2008.04.034","volume":"309","author":"J Hung","year":"2009","unstructured":"Hung J, Tong L, Wang H (2009) The hull and geodetic numbers of orientations of graphs. Discrete Math 309:2134\u20132139","journal-title":"Discrete Math"},{"key":"8_CR59_8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0166-218X(99)00084-0","volume":"95","author":"W Imrich","year":"1999","unstructured":"Imrich W, Klav\u017ear S (1999) Recognizing graphs of acyclic cubical complexes. Discrete Appl Math 95:321\u2013330","journal-title":"Discrete Appl Math"},{"key":"8_CR60_8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/S0895480197323494","volume":"12","author":"W Imrich","year":"1999","unstructured":"Imrich W, Klav\u017ear S, Mulder HM (1999) Median graphs and triangle-free graphs. SIAM J Discrete Math 12:111\u2013118","journal-title":"SIAM J Discrete Math"},{"key":"8_CR61_8","volume-title":"Product graphs: structure and recognition","author":"W Imrich","year":"2000","unstructured":"Imrich W, Klav\u017ear S (2000) Product graphs: structure and recognition. Wiley, NY"},{"key":"8_CR62_8","first-page":"535","volume":"29","author":"RE Jamison","year":"1980","unstructured":"Jamison RE (1980) Copoints in antimatroids. Congr Numer 29:535\u2013544","journal-title":"Congr Numer"},{"unstructured":"Jiang T, Pelayo I, Pritikin D (2004) Geodesic convexity and Cartesian products in graphs. Manuscript","key":"8_CR63_8"},{"key":"8_CR64_8","first-page":"103","volume":"30","author":"S Klav\u017ear","year":"1999","unstructured":"Klav\u017ear S, Mulder HM (1999) Median graphs: characterizations, location theory and related structures. J Combin Math Combin Comp 30:103\u2013127","journal-title":"J Combin Math Combin Comp"},{"key":"8_CR65_8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0166-218X(86)90049-1","volume":"15","author":"B Korte","year":"1986","unstructured":"Korte B, Lov\u00e1sz L (1986) Homomorphisms and Ramsey properties of antimatroids. Discrete Appl Math 15:283\u2013290","journal-title":"Discrete Appl Math"},{"key":"8_CR66_8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0166-218X(97)00084-X","volume":"81","author":"E Kubicka","year":"1998","unstructured":"Kubicka E, Kubicki G, Oellermann OR (1998) Steiner intervals in graphs. Discrete Math 81:181\u2013190","journal-title":"Discrete Math"},{"key":"8_CR67_8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0166-218X(02)00211-1","volume":"127","author":"B Leclerc","year":"2003","unstructured":"Leclerc B (2003) The median procedure in the semilattice of orders. Discrete Appl Math 127:285\u2013302","journal-title":"Discrete Appl Math"},{"key":"8_CR68_8","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1007\/s11425-007-0048-x","volume":"50","author":"C Lu","year":"2007","unstructured":"Lu C (2007) The geodetic numbers of graphs and digraphs. Sci China Ser A 50:1163\u20131172","journal-title":"Sci China Ser A"},{"key":"8_CR69_8","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/S0012-365X(01)00296-5","volume":"254","author":"MA Morgana","year":"2002","unstructured":"Morgana MA, Mulder HM (2002) The induced path convexity, betweenness and svelte graphs. Discrete Math 254:349\u2013370","journal-title":"Discrete Math"},{"key":"8_CR70_8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0012-365X(78)90199-1","volume":"24","author":"HM Mulder","year":"1978","unstructured":"Mulder HM (1978) The structure of median graphs. Discrete Math 24:197\u2013204","journal-title":"Discrete Math"},{"key":"8_CR71_8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1002\/jgt.3190040112","volume":"4","author":"HM Mulder","year":"1980","unstructured":"Mulder HM (1980) n-Cubes and median graphs. J Graph Theory 4:107\u2013110","journal-title":"J Graph Theory"},{"unstructured":"Mulder HM (1980) The interval function of a graph. Mathematical Centre Tracts 132. Mathematisch Centrum, Amsterdam","key":"8_CR72_8"},{"key":"8_CR73_8","volume-title":"Contemporary methods in graph theory","author":"HM Mulder","year":"1990","unstructured":"Mulder HM (1990) The expansion procedure for graphs. In: Bodendiek R (ed) Contemporary methods in graph theory. Manhaim\/Wien\/Z\u00fcrich: B.I. Wissenschaftsverlag"},{"unstructured":"Mulder HM (2008) Transit functions on graphs (and posets). In: Changat M, Klav\u017ear S, Mulder HM, Vijayakumar A (eds) Convexity in discrete structures. Lecture Notes Ser. 5, Ramanujan Math Soc, pp 117\u2013130","key":"8_CR74_8"},{"key":"8_CR75_8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/16073606.1988.9632167","volume":"12","author":"M Nec\u00e1skov\u00e1","year":"1988","unstructured":"Nec\u00e1skov\u00e1 M (1988) A note on the achievement geodetic games. Quaest Math 12:115\u2013119","journal-title":"Quaest Math"},{"key":"8_CR76_8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.disc.2006.04.037","volume":"307","author":"OR Oellermann","year":"2007","unstructured":"Oellermann OR, Puertas ML (2007) Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs. Discrete Math 307:88\u201396","journal-title":"Discrete Math"},{"key":"8_CR77_8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.disc.2003.10.016","volume":"280","author":"I Pelayo","year":"2004","unstructured":"Pelayo I (2004) Comment on: \u201cThe Steiner number of a graph\u201d by Chartrand G, Zhang P [Discrete Math 242:1\u20133, 41\u201354 (2002)]. Discrete Math 280:259\u2013263","journal-title":"Discrete Math"},{"key":"8_CR78_8","doi-asserted-by":"publisher","first-page":"1623","DOI":"10.1016\/j.disc.2008.02.033","volume":"309","author":"L Tong","year":"2009","unstructured":"Tong L (2009) The (a,b)-forcing geodetic graphs. Discrete Math 309:1623\u20131628","journal-title":"Discrete Math"},{"key":"8_CR79_8","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/j.dam.2008.03.023","volume":"157","author":"L Tong","year":"2009","unstructured":"Tong L (2009) The forcing hull and forcing geodetic numbers of graphs. Discrete Appl Math 157:1159\u20131163","journal-title":"Discrete Appl Math"},{"key":"8_CR80_8","volume-title":"Theory of convex structures","author":"van de Vel MLJ","year":"1993","unstructured":"van de Vel MLJ (1993) Theory of convex structures. North Holland, Amsterdam"},{"key":"8_CR81_8","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ejor.2005.04.026","volume":"175","author":"F Wang","year":"2006","unstructured":"Wang F, Wang Y, Chang J (2006) The lower and upper forcing geodetic numbers of block-cactus graphs. Eur J Oper Res 175:238\u2013245","journal-title":"Eur J Oper Res"},{"unstructured":"William HE, McMorris FR (2003) Axiomatic concensus theory in group choice and bioinformatics. J Soc Ind Appl Math:91\u201394","key":"8_CR82_8"},{"key":"8_CR83_8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0166-218X(84)90069-6","volume":"7","author":"P Winkler","year":"1984","unstructured":"Winkler P (1984) Isometric embeddings in products of complete graphs. Discrete Appl Math 7:221\u2013225","journal-title":"Discrete Appl Math"},{"key":"8_CR84_8","first-page":"158","volume":"20","author":"Y Ye","year":"2007","unstructured":"Ye Y, Lu C, Liu Q (2007) The geodetic numbers of Cartesian products of graphs. Math Appl (Wuhan) 20:158\u2013163","journal-title":"Math Appl (Wuhan)"},{"key":"8_CR85_8","first-page":"3","volume":"62","author":"P Zhang","year":"2002","unstructured":"Zhang P (2002) The upper forcing geodetic number of a graph. Ars Combinatoria 62:3\u201315","journal-title":"Ars Combinatoria"}],"container-title":["Structural Analysis of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-8176-4789-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T22:44:34Z","timestamp":1675896274000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-8176-4789-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,16]]},"ISBN":["9780817647889","9780817647896"],"references-count":86,"URL":"https:\/\/doi.org\/10.1007\/978-0-8176-4789-6_8","relation":{},"subject":[],"published":{"date-parts":[[2010,9,16]]},"assertion":[{"value":"16 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}