{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:30:53Z","timestamp":1648884653281},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,2]]},"abstract":"<jats:p> In this paper, we define the clique-to-vertex [Formula: see text]\u2013[Formula: see text] monophonic path, the clique-to-vertex monophonic distance [Formula: see text], the clique-to-vertex monophonic eccentricity [Formula: see text], the clique-to-vertex monophonic radius [Formula: see text], and the clique-to-vertex monophonic diameter [Formula: see text], where [Formula: see text] is a clique and [Formula: see text] a vertex in a connected graph [Formula: see text]. We determine these parameters for some standard graphs. We show the inequality among the clique-to-vertex distance, the clique-to-vertex monophonic distance, and the clique-to-vertex detour distance in graphs. Also, it is shown that the clique-to-vertex geodesic, the clique-to-vertex monophonic, and the clique-to-vertex detour are distinct in [Formula: see text]. It is shown that [Formula: see text] for every connected graph [Formula: see text] and that every two positive integers [Formula: see text] and [Formula: see text] with [Formula: see text] are realizable as the clique-to-vertex monophonic radius and clique-to-vertex monophonic diameter of some connected graph. Also, it is shown any three positive integers [Formula: see text] with [Formula: see text] are realizable as the clique-to-vertex radius, clique-to-vertex monophonic radius, and clique-to-vertex detour radius of some connected graph and also it is shown that any three positive integers [Formula: see text] with [Formula: see text] are realizable as the clique-to-vertex diameter, clique-to-vertex monophonic diameter, and clique-to-vertex detour diameter of some connected graph. We introduce the clique-to-vertex monophonic center [Formula: see text] and the clique-to-vertex monophonic periphery [Formula: see text] and it is shown that the clique-to-vertex monophonic center does not lie in a single block of [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830917500045","type":"journal-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T03:42:43Z","timestamp":1477366963000},"page":"1750004","source":"Crossref","is-referenced-by-count":0,"title":["Clique-to-vertex monophonic distance in graphs"],"prefix":"10.1142","volume":"09","author":[{"given":"I. Keerthi","family":"Asir","sequence":"first","affiliation":[{"name":"Department of Mathematics, St. Xavier\u2019s College (Autonomous), Palayamkottai - 627 002, Tamil Nadu, India"}]},{"given":"S.","family":"Athisayanathan","sequence":"additional","affiliation":[{"name":"Research Department of Mathematics, St. Xavier\u2019s College (Autonomous), Palayamkottai - 627 002, Tamil Nadu, India"}]}],"member":"219","published-online":{"date-parts":[[2017,2,6]]},"reference":[{"key":"S1793830917500045BIB001","first-page":"75","volume":"53","author":"Chartrand G.","year":"2005","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"S1793830917500045BIB002","volume-title":"Introduction to Graph Theory","author":"Chartrand G.","year":"2006"},{"key":"S1793830917500045BIB003","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"S1793830917500045BIB004","first-page":"42","volume":"11","author":"Keerthi Asir I.","year":"2015","journal-title":"J. Prime Res. Math."},{"key":"S1793830917500045BIB005","first-page":"71","volume":"4","author":"Ostrand P. A.","year":"1973","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S1793830917500045BIB006","first-page":"275","volume":"3","author":"Santhakumaran A. P.","year":"2002","journal-title":"Int. J. Manag. Syst."},{"key":"S1793830917500045BIB007","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\/S1793830917500045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:04:50Z","timestamp":1565096690000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":7,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2017,2,6]]},"published-print":{"date-parts":[[2017,2]]}},"alternative-id":["10.1142\/S1793830917500045"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500045","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2]]}}}