{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:53:07Z","timestamp":1648511587141},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2011,10,7]],"date-time":"2011-10-07T00:00:00Z","timestamp":1317945600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s00373-011-1085-3","type":"journal-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T11:20:25Z","timestamp":1317900025000},"page":"781-789","source":"Crossref","is-referenced-by-count":1,"title":["A Classification of Graphs Whose Subdivision Graph is Locally Distance Transitive"],"prefix":"10.1007","volume":"28","author":[{"given":"Ashraf","family":"Daneshkhah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alice","family":"Devillers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,7]]},"reference":[{"key":"1085_CR1","first-page":"113","volume":"5","author":"N. Biggs","year":"1974","unstructured":"Biggs N.: The symmetry of line graphs. Util. Math. 5, 113\u2013121 (1974)","journal-title":"Util. Math."},{"key":"1085_CR2","doi-asserted-by":"crossref","unstructured":"Daneshkhah, A., Devillers, A., Praeger, C.E.: Symmetry properties of subdivision graphs. Discrete Mathematics. (2011). doi: 10.1016\/j.disc.2011.03.031 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0012365X11001415 .","DOI":"10.1016\/j.disc.2011.03.031"},{"issue":"1","key":"1085_CR3","first-page":"89","volume":"43","author":"E. Govaert","year":"2002","unstructured":"Govaert E., Van Maldeghem H.: Distance-preserving maps in generalized polygons. I. Maps on flags. Beitr\u00e4ge Algebra Geom. 43(1), 89\u2013110 (2002)","journal-title":"Beitr\u00e4ge Algebra Geom."},{"key":"1085_CR4","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1147\/rd.45.0497","volume":"4","author":"A.J. Hoffman","year":"1960","unstructured":"Hoffman A.J., Singleton R.R.: On Moore graphs with diameters 2 and 3. IBM J. Res. Develop. 4, 497\u2013504 (1960)","journal-title":"IBM J. Res. Develop."},{"key":"1085_CR5","volume-title":"The Petersen graph, Australian Mathematical Society Lecture Series. vol. 7","author":"D.A. Holton","year":"1993","unstructured":"Holton D.A., Sheehan J.: The Petersen graph, Australian Mathematical Society Lecture Series. vol. 7. Cambridge University Press, Cambridge (1993)"},{"issue":"9","key":"1085_CR6","doi-asserted-by":"crossref","first-page":"3511","DOI":"10.1090\/S0002-9947-01-02768-4","volume":"353","author":"C.H. Li","year":"2001","unstructured":"Li C.H.: The finite vertex-primitive and vertex-biprimitive s-transitive graphs for s \u2265 4. Trans. Am. Math. Soc. 353(9), 3511\u20133529 (2001)","journal-title":"Trans. Am. Math. Soc."},{"key":"1085_CR7","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BF01181398","volume":"71","author":"T.G. Ostrom","year":"1959","unstructured":"Ostrom T.G., Wagner A.: On projective and affine planes with transitive collineation groups. Math. Z 71, 186\u2013199 (1959)","journal-title":"Math. Z"},{"key":"1085_CR8","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0021-9800(66)80054-6","volume":"1","author":"R. Singleton","year":"1966","unstructured":"Singleton R.: On minimal graphs of maximum even girth. J. Comb. Theory 1, 306\u2013332 (1966)","journal-title":"J. Comb. Theory"},{"issue":"2","key":"1085_CR9","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BF01270491","volume":"45","author":"R. Weiss","year":"1985","unstructured":"Weiss R.: Distance-transitive graphs and generalized polygons. Arch. Math. (Basel) 45(2), 186\u2013192 (1985)","journal-title":"Arch. Math. (Basel)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1085-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1085-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1085-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:33Z","timestamp":1559041113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1085-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,7]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["1085"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1085-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,7]]}}}