{"title":"论意大利在图形上的完美统治","authors":"Leonard M. Paleta, Ferdinand P. Jamil","doi":"10.1142/s1793830923500854","DOIUrl":null,"url":null,"abstract":"For a vertex [Formula: see text] in a simple, finite and undirected graph [Formula: see text], the neighborhood [Formula: see text] of [Formula: see text] is the set consisting of all vertices of [Formula: see text] which are adjacent to [Formula: see text]. A perfect Italian dominating function on [Formula: see text] is a function [Formula: see text] such that for each [Formula: see text] with [Formula: see text], [Formula: see text]. The weight of a perfect Italian dominating function [Formula: see text] is the value [Formula: see text]. The perfect Italian domination number of [Formula: see text] is the minimum weight of a perfect Italian dominating function on [Formula: see text]. In this paper, we study the perfect Italian domination in graphs under some binary operations.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"34 31","pages":"0"},"PeriodicalIF":0.6000,"publicationDate":"2023-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On perfect Italian domination in graphs\",\"authors\":\"Leonard M. Paleta, Ferdinand P. Jamil\",\"doi\":\"10.1142/s1793830923500854\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a vertex [Formula: see text] in a simple, finite and undirected graph [Formula: see text], the neighborhood [Formula: see text] of [Formula: see text] is the set consisting of all vertices of [Formula: see text] which are adjacent to [Formula: see text]. A perfect Italian dominating function on [Formula: see text] is a function [Formula: see text] such that for each [Formula: see text] with [Formula: see text], [Formula: see text]. The weight of a perfect Italian dominating function [Formula: see text] is the value [Formula: see text]. The perfect Italian domination number of [Formula: see text] is the minimum weight of a perfect Italian dominating function on [Formula: see text]. In this paper, we study the perfect Italian domination in graphs under some binary operations.\",\"PeriodicalId\":45568,\"journal\":{\"name\":\"Discrete Mathematics Algorithms and Applications\",\"volume\":\"34 31\",\"pages\":\"0\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-10-31\",\"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/s1793830923500854\",\"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/s1793830923500854","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
For a vertex [Formula: see text] in a simple, finite and undirected graph [Formula: see text], the neighborhood [Formula: see text] of [Formula: see text] is the set consisting of all vertices of [Formula: see text] which are adjacent to [Formula: see text]. A perfect Italian dominating function on [Formula: see text] is a function [Formula: see text] such that for each [Formula: see text] with [Formula: see text], [Formula: see text]. The weight of a perfect Italian dominating function [Formula: see text] is the value [Formula: see text]. The perfect Italian domination number of [Formula: see text] is the minimum weight of a perfect Italian dominating function on [Formula: see text]. In this paper, we study the perfect Italian domination in graphs under some binary operations.