{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T03:58:14Z","timestamp":1769831894544,"version":"3.49.0"},"reference-count":8,"publisher":"SAGE Publications","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2022,9,22]]},"abstract":"<jats:p>A set S\u00a0\u2286\u00a0V in a graph G is a MED-set if every vertex in V\u00a0-\u00a0S has a monophonic eccentric vertex in S. The MED-number \u03b3me\u00a0(G) is the cardinality of a minimum MED-set of G. A set S\u00a0\u2286\u00a0V in a graph G is a CMED-set if S is a MED-set and the induced subgraph is connected. The CMED-number \u03b3cme\u00a0(G) is the cardinality of a minimum CMED-set of G. We investigate some properties of the CMED-sets. Also, we determine the bounds of the CMED-number and find the same for some standard graphs. The CMED-number has applications in security based communication networks in real life situations. This motivated us to introduce and investigate CMED-set in a graph.<\/jats:p>","DOI":"10.3233\/jifs-220463","type":"journal-article","created":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T12:06:20Z","timestamp":1657627580000},"page":"6451-6460","source":"Crossref","is-referenced-by-count":0,"title":["The connected monophonic eccentric domination number of a graph"],"prefix":"10.1177","volume":"43","author":[{"given":"P.","family":"Titus","sequence":"first","affiliation":[{"name":"Department of Science and Humanities, University College of Engineering Nagercoil, Anna University, Tirunelveli Region, Nagercoil, India"}]},{"given":"J.","family":"Ajitha Fancy","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Scott Christian College (Autonomous), Nagercoil, India"}]},{"given":"Gyanendra Prasad","family":"Joshi","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Sejong University, Seoul, Korea"}]},{"given":"S.","family":"Amutha","sequence":"additional","affiliation":[{"name":"Ramanujan Centre for Higher Mathematics, Alagappa University, Karaikudi, India"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-220463_ref1","unstructured":"Berge C. , Theory of Graphs and its Applications, Methuen, London, 1962."},{"key":"10.3233\/JIFS-220463_ref2","first-page":"149","article-title":"Detour Domination in Graphs","volume":"71","author":"Chartrand","year":"2004","journal-title":"Ars Combinatoria"},{"key":"10.3233\/JIFS-220463_ref3","doi-asserted-by":"crossref","unstructured":"Harary F. , Graph Theory, Addison-Wesley, 1969.","DOI":"10.21236\/AD0705364"},{"key":"10.3233\/JIFS-220463_ref4","unstructured":"Haynes T.W. , Hedetniemi S.T. and Slater P.J. , Fundamentals of Domination in Graphs, Marcel Dekker, Inc, New York, 1998."},{"key":"10.3233\/JIFS-220463_ref5","doi-asserted-by":"crossref","unstructured":"Ore O. , Theory of Graphs, American Mathematical Society Colloquium Publications, 38, 1962.","DOI":"10.1090\/coll\/038"},{"issue":"6","key":"10.3233\/JIFS-220463_ref6","first-page":"607","article-title":"The Connected Domination Number of a Graph","volume":"13","author":"Sampathkumar","year":"1979","journal-title":"Journal of Mathematical and Physical Sciences"},{"issue":"2","key":"10.3233\/JIFS-220463_ref7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1142\/S1793830911001176","article-title":"Monophonic Distance in Graphs","volume":"3","author":"Santhakumaran","year":"2011","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"key":"10.3233\/JIFS-220463_ref8","doi-asserted-by":"publisher","DOI":"10.1142\/s1793830912500188"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-220463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T15:16:46Z","timestamp":1769786206000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-220463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,22]]},"references-count":8,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.3233\/jifs-220463","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,22]]}}}