{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T04:15:52Z","timestamp":1761970552579,"version":"build-2065373602"},"reference-count":4,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2012,6]]},"abstract":"<jats:p> In the paper entitled, \"Monophonic Distance in Graphs\", which appeared in Discrete Mathematics, Algorithms and Applications3(2) (2011) 159\u2013169, it was proved (Theorem 3.4) that every graph is the monophonic center of some connected graph. Although the statement of the theorem is true, the proof given works only for graphs with monophonic diameter at most 2. Hence, we give a new proof of the same theorem, which works for all graphs. We settle completely the second part of Theorem 2.10(b) in that paper for all values a, b, c with 1 \u2264 a \u2264 b \u2264 c, which also solves the Problem 2.12 given in that paper. <\/jats:p>","DOI":"10.1142\/s1793830912500188","type":"journal-article","created":{"date-parts":[[2012,6,19]],"date-time":"2012-06-19T14:55:53Z","timestamp":1340117753000},"page":"1250018","source":"Crossref","is-referenced-by-count":11,"title":["A NOTE ON \"MONOPHONIC DISTANCE IN GRAPHS\""],"prefix":"10.1142","volume":"04","author":[{"given":"A. P.","family":"SANTHAKUMARAN","sequence":"first","affiliation":[{"name":"Department of Mathematics, Hindustan University, Hindustan Institute of Technology and Science, Padur, Chennai - 603 103, India"}]},{"given":"P.","family":"TITUS","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Anna University of Technology Tirunelveli, Nagercoil - 629 004, India"}]}],"member":"219","published-online":{"date-parts":[[2012,6,21]]},"reference":[{"volume-title":"Distance in Graphs","year":"1990","author":"Buckley F.","key":"rf1"},{"key":"rf2","first-page":"75","volume":"53","author":"Chartrand G.","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"rf3","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"Harary F.","year":"1969"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830911001176"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830912500188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:42:08Z","timestamp":1565131328000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830912500188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":4,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2012,6,21]]},"published-print":{"date-parts":[[2012,6]]}},"alternative-id":["10.1142\/S1793830912500188"],"URL":"https:\/\/doi.org\/10.1142\/s1793830912500188","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}