{"title":"单向星型的支配多项式","authors":"Sanal Kumar, Jithin Matthew","doi":"10.59461/ijitra.v2i3.67","DOIUrl":null,"url":null,"abstract":"Let be a finite directed graph without isolated node. The domination polynomial of is defined by D(G, x) where d(G, i)is the cardinality of the set of dominating sets of with nodes. In this paper, we study the domination polynomial of unidirectional star graphs.","PeriodicalId":187267,"journal":{"name":"International Journal of Information Technology, Research and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Domination Polynomials of Unidirectional Star\",\"authors\":\"Sanal Kumar, Jithin Matthew\",\"doi\":\"10.59461/ijitra.v2i3.67\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let be a finite directed graph without isolated node. The domination polynomial of is defined by D(G, x) where d(G, i)is the cardinality of the set of dominating sets of with nodes. In this paper, we study the domination polynomial of unidirectional star graphs.\",\"PeriodicalId\":187267,\"journal\":{\"name\":\"International Journal of Information Technology, Research and Applications\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Information Technology, Research and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.59461/ijitra.v2i3.67\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Information Technology, Research and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.59461/ijitra.v2i3.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Let be a finite directed graph without isolated node. The domination polynomial of is defined by D(G, x) where d(G, i)is the cardinality of the set of dominating sets of with nodes. In this paper, we study the domination polynomial of unidirectional star graphs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
