{"title":"图的强非分裂饱和数","authors":"Y. Therese Sunitha Mary, R. Kala","doi":"10.1142/s1793830923500891","DOIUrl":null,"url":null,"abstract":"The strong nonsplit domsaturation number of a graph [Formula: see text], [Formula: see text] is the least positive integer [Formula: see text] such that every vertex of [Formula: see text] lies in a strong nonsplit dominating set of cardinality [Formula: see text]. In this paper, we obtain certain bounds for [Formula: see text] and characterize the graphs which attain these bounds.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"14 11","pages":"0"},"PeriodicalIF":0.6000,"publicationDate":"2023-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Strong Nonsplit domsaturation number of a graph\",\"authors\":\"Y. Therese Sunitha Mary, R. Kala\",\"doi\":\"10.1142/s1793830923500891\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The strong nonsplit domsaturation number of a graph [Formula: see text], [Formula: see text] is the least positive integer [Formula: see text] such that every vertex of [Formula: see text] lies in a strong nonsplit dominating set of cardinality [Formula: see text]. In this paper, we obtain certain bounds for [Formula: see text] and characterize the graphs which attain these bounds.\",\"PeriodicalId\":45568,\"journal\":{\"name\":\"Discrete Mathematics Algorithms and Applications\",\"volume\":\"14 11\",\"pages\":\"0\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s1793830923500891\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s1793830923500891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
The strong nonsplit domsaturation number of a graph [Formula: see text], [Formula: see text] is the least positive integer [Formula: see text] such that every vertex of [Formula: see text] lies in a strong nonsplit dominating set of cardinality [Formula: see text]. In this paper, we obtain certain bounds for [Formula: see text] and characterize the graphs which attain these bounds.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
