{"title":"棱镜图族的最小支配集","authors":"Veninstine Vivik J","doi":"10.5206/mase/15775","DOIUrl":null,"url":null,"abstract":"The dominating set of the graph G is a subset D of vertex set V, such that every vertex not in V-D is adjacent to at least one vertex in the vertex subset D. A dominating set D is a minimal dominating set if no proper subset of D is a dominating set. The number of elements in such set is called as domination number of graph and is denoted by $\\gamma(G)$. In this work the domination numbers are obtained for family of prism graphs such as prism CL_n, antiprism Q_n and crossed prism R_n by identifying one of their minimum dominating set.","PeriodicalId":93797,"journal":{"name":"Mathematics in applied sciences and engineering","volume":" ","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimum Dominating Set for the Prism Graph Family\",\"authors\":\"Veninstine Vivik J\",\"doi\":\"10.5206/mase/15775\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The dominating set of the graph G is a subset D of vertex set V, such that every vertex not in V-D is adjacent to at least one vertex in the vertex subset D. A dominating set D is a minimal dominating set if no proper subset of D is a dominating set. The number of elements in such set is called as domination number of graph and is denoted by $\\\\gamma(G)$. In this work the domination numbers are obtained for family of prism graphs such as prism CL_n, antiprism Q_n and crossed prism R_n by identifying one of their minimum dominating set.\",\"PeriodicalId\":93797,\"journal\":{\"name\":\"Mathematics in applied sciences and engineering\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematics in applied sciences and engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5206/mase/15775\",\"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":"Mathematics in applied sciences and engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5206/mase/15775","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
The dominating set of the graph G is a subset D of vertex set V, such that every vertex not in V-D is adjacent to at least one vertex in the vertex subset D. A dominating set D is a minimal dominating set if no proper subset of D is a dominating set. The number of elements in such set is called as domination number of graph and is denoted by $\gamma(G)$. In this work the domination numbers are obtained for family of prism graphs such as prism CL_n, antiprism Q_n and crossed prism R_n by identifying one of their minimum dominating set.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
