{"title":"On the connected monophonic number of a graph","authors":"K. Ganesamoorthy, M. Murugan, A. Santhakumaran","doi":"10.1080/23799927.2022.2071765","DOIUrl":null,"url":null,"abstract":"For a connected graph G of order at least two, a connected monophonic set of G is a monophonic set S such that the subgraph induced by S is connected. The minimum cardinality of a connected monophonic set of G is the connected monophonic number of G and is denoted by . The number of extreme vertices and cut-vertices of G is its extreme-cut order . A graph G is an extreme-cut connected monophonic graph if . Some interesting results on the extreme-cut connected monophonic graphs G are studied. For positive integers r, d and with r<d, there exists an extreme-cut connected monophonic graph G with monophonic radius r, monophonic diameter d and the connected monophonic number k. Also if p, d and k are positive integers such that and , then there exists an extreme-cut connected monophonic graph G of order p with monophonic diameter d and .","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"163 1","pages":"139 - 148"},"PeriodicalIF":0.9000,"publicationDate":"2022-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2022.2071765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 7
Abstract
For a connected graph G of order at least two, a connected monophonic set of G is a monophonic set S such that the subgraph induced by S is connected. The minimum cardinality of a connected monophonic set of G is the connected monophonic number of G and is denoted by . The number of extreme vertices and cut-vertices of G is its extreme-cut order . A graph G is an extreme-cut connected monophonic graph if . Some interesting results on the extreme-cut connected monophonic graphs G are studied. For positive integers r, d and with r