Zoran Maksimovic, Aleksandar Lj. Savić, M. Bogdanovic
{"title":"凸多面体的凸和弱凸控制数","authors":"Zoran Maksimovic, Aleksandar Lj. Savić, M. Bogdanovic","doi":"10.33044/revuma.1739","DOIUrl":null,"url":null,"abstract":"This paper is devoted to solving the weakly convex dominating set problem and the convex dominating set problem for some classes of planar graphs—convex polytopes. We consider all classes of convex polytopes known from the literature and present exact values of weakly convex and convex domination number for all classes, namely An, Bn, Cn, Dn, En, Rn, R′′ n, Qn, Sn, S′′ n , Tn, T ′′ n and Un. When n is up to 26, the values are confirmed by using the exact method, while for greater values of n theoretical proofs are given.","PeriodicalId":54469,"journal":{"name":"Revista De La Union Matematica Argentina","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2022-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The convex and weak convex domination number of convex polytopes\",\"authors\":\"Zoran Maksimovic, Aleksandar Lj. Savić, M. Bogdanovic\",\"doi\":\"10.33044/revuma.1739\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is devoted to solving the weakly convex dominating set problem and the convex dominating set problem for some classes of planar graphs—convex polytopes. We consider all classes of convex polytopes known from the literature and present exact values of weakly convex and convex domination number for all classes, namely An, Bn, Cn, Dn, En, Rn, R′′ n, Qn, Sn, S′′ n , Tn, T ′′ n and Un. When n is up to 26, the values are confirmed by using the exact method, while for greater values of n theoretical proofs are given.\",\"PeriodicalId\":54469,\"journal\":{\"name\":\"Revista De La Union Matematica Argentina\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Revista De La Union Matematica Argentina\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.33044/revuma.1739\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Revista De La Union Matematica Argentina","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.33044/revuma.1739","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
研究了一类平面图-凸多面体的弱凸控制集问题和凸控制集问题。我们考虑了文献中已知的所有凸多面体的类,并给出了所有类的弱凸和凸控制数的精确值,即An, Bn, Cn, Dn, En, Rn, R ' n, Qn, Sn, S ' n, Tn, T ' n和Un。当n≤26时,用精确方法确定,当n大于26时,给出理论证明。
The convex and weak convex domination number of convex polytopes
This paper is devoted to solving the weakly convex dominating set problem and the convex dominating set problem for some classes of planar graphs—convex polytopes. We consider all classes of convex polytopes known from the literature and present exact values of weakly convex and convex domination number for all classes, namely An, Bn, Cn, Dn, En, Rn, R′′ n, Qn, Sn, S′′ n , Tn, T ′′ n and Un. When n is up to 26, the values are confirmed by using the exact method, while for greater values of n theoretical proofs are given.
期刊介绍:
Revista de la Unión Matemática Argentina is an open access journal, free of charge for both authors and readers. We publish original research articles in all areas of pure and applied mathematics.