{"title":"广义Petersen图和flower snark图的弱凸数和凸支配数","authors":"J. Kratica, Dragan Matic, V. Filipović","doi":"10.33044/revuma.v61n2a16","DOIUrl":null,"url":null,"abstract":". We consider the weakly convex and convex domination numbers for two classes of graphs: generalized Petersen graphs and flower snark graphs. For a given generalized Petersen graph GP ( n,k ), we prove that if k = 1 and n ≥ 4 then both the weakly convex domination number γ wcon ( GP ( n,k )) and the convex domination number γ con ( GP ( n,k )) are equal to n . For k ≥ 2 and n ≥ 13, γ wcon ( GP ( n,k )) = γ con ( GP ( n,k )) = 2 n , which is the order of GP ( n,k ). Special cases for smaller graphs are solved by the exact method. For a flower snark graph J n , where n is odd and n ≥ 5, we prove that γ wcon ( J n ) = 2 n and γ con ( J n ) = 4 n .","PeriodicalId":54469,"journal":{"name":"Revista De La Union Matematica Argentina","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2020-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs\",\"authors\":\"J. Kratica, Dragan Matic, V. Filipović\",\"doi\":\"10.33044/revuma.v61n2a16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". We consider the weakly convex and convex domination numbers for two classes of graphs: generalized Petersen graphs and flower snark graphs. For a given generalized Petersen graph GP ( n,k ), we prove that if k = 1 and n ≥ 4 then both the weakly convex domination number γ wcon ( GP ( n,k )) and the convex domination number γ con ( GP ( n,k )) are equal to n . For k ≥ 2 and n ≥ 13, γ wcon ( GP ( n,k )) = γ con ( GP ( n,k )) = 2 n , which is the order of GP ( n,k ). Special cases for smaller graphs are solved by the exact method. For a flower snark graph J n , where n is odd and n ≥ 5, we prove that γ wcon ( J n ) = 2 n and γ con ( J n ) = 4 n .\",\"PeriodicalId\":54469,\"journal\":{\"name\":\"Revista De La Union Matematica Argentina\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2020-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Revista De La Union Matematica Argentina\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.33044/revuma.v61n2a16\",\"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.v61n2a16","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs
. We consider the weakly convex and convex domination numbers for two classes of graphs: generalized Petersen graphs and flower snark graphs. For a given generalized Petersen graph GP ( n,k ), we prove that if k = 1 and n ≥ 4 then both the weakly convex domination number γ wcon ( GP ( n,k )) and the convex domination number γ con ( GP ( n,k )) are equal to n . For k ≥ 2 and n ≥ 13, γ wcon ( GP ( n,k )) = γ con ( GP ( n,k )) = 2 n , which is the order of GP ( n,k ). Special cases for smaller graphs are solved by the exact method. For a flower snark graph J n , where n is odd and n ≥ 5, we prove that γ wcon ( J n ) = 2 n and γ con ( J n ) = 4 n .
期刊介绍:
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.