{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T09:22:53Z","timestamp":1648545773873},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,7,29]],"date-time":"2017-07-29T00:00:00Z","timestamp":1501286400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10878-017-0160-y","type":"journal-article","created":{"date-parts":[[2017,7,29]],"date-time":"2017-07-29T09:55:57Z","timestamp":1501322157000},"page":"134-147","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Total and forcing total edge-to-vertex monophonic number of a graph"],"prefix":"10.1007","volume":"35","author":[{"given":"J.","family":"John","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Uma Samundesvari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,29]]},"reference":[{"key":"160_CR1","volume-title":"Distance in graphs","author":"F Buckley","year":"1990","unstructured":"Buckley F, Harary F (1990) Distance in graphs. Addition-Wesley, Redwood City"},{"key":"160_CR2","first-page":"29","volume":"3","author":"J John","year":"2012","unstructured":"John J, Arul Paul Sudhahar P (2012) The upper connected monophonic number and forcing connected monophonic number of a graph. Int J Math Trends Technol 3:29\u201332","journal-title":"Int J Math Trends Technol"},{"key":"160_CR3","first-page":"46","volume":"4","author":"J John","year":"2010","unstructured":"John J, Panchali S (2010) The upper monophonic number of a graph. Int J Math Comb 4:46\u201352","journal-title":"Int J Math Comb"},{"key":"160_CR4","first-page":"722","volume":"3","author":"J John","year":"2012","unstructured":"John J, Uma Samundesvari K (2012a) The edge-to-vertex monophonic number of a graph. Int J Math Arch 3:722\u2013728","journal-title":"Int J Math Arch"},{"issue":"4","key":"160_CR5","first-page":"349","volume":"2","author":"J John","year":"2012","unstructured":"John J, Uma Samundesvari K (2012b) The upper and forcing edge-to-vertex monophonic number of a graph, South Asian. J Math 2(4):349\u2013359","journal-title":"J Math"},{"key":"160_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(73)90116-7","volume":"4","author":"PA Ostrand","year":"1973","unstructured":"Ostrand PA (1973) Graphs with specified radius and diameter. Discrete Math 4:71\u201375","journal-title":"Discrete Math"},{"key":"160_CR7","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1016\/j.disc.2006.08.002","volume":"307","author":"EM Paluga","year":"2007","unstructured":"Paluga EM, Canoy SR Jr (2007) Monophonic numbers of the join and composition of connected graphs. Discrete Math 307:1146\u20131154","journal-title":"Discrete Math"},{"key":"160_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.18514\/MMN.2012.353","volume":"13","author":"AP Santhakumaran","year":"2012","unstructured":"Santhakumaran AP, John J (2012) On the edge-to-vertex geodetic number of a graph. Miskolc Math Notes 13:107\u2013119","journal-title":"Miskolc Math Notes"},{"key":"160_CR9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1142\/S1793830911001176","volume":"3","author":"AP Santhakumaran","year":"2011","unstructured":"Santhakumaran AP, Titus P (2011) Monophonic distance in graphs. Discrete Algorithms Appl 3:159\u2013169","journal-title":"Discrete Algorithms Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0160-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0160-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0160-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T16:10:31Z","timestamp":1569946231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0160-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,29]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["160"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0160-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,29]]}}}