{"title":"关于图的一些独立的公平支配","authors":"Mark Caay, Marjun Durog","doi":"10.56947/gjom.v11i1.668","DOIUrl":null,"url":null,"abstract":"One of the most interesting facts about the study of connectivity and working is in the area of domination. By this, we determine the independent equitable domination number of some graphs and some results. Moreover, we investigate graphs with the existence of independent equitable dominating set.","PeriodicalId":421614,"journal":{"name":"Gulf Journal of Mathematics","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On some independent equitable domination of graphs\",\"authors\":\"Mark Caay, Marjun Durog\",\"doi\":\"10.56947/gjom.v11i1.668\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the most interesting facts about the study of connectivity and working is in the area of domination. By this, we determine the independent equitable domination number of some graphs and some results. Moreover, we investigate graphs with the existence of independent equitable dominating set.\",\"PeriodicalId\":421614,\"journal\":{\"name\":\"Gulf Journal of Mathematics\",\"volume\":\"112 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Gulf Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.56947/gjom.v11i1.668\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Gulf Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.56947/gjom.v11i1.668","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On some independent equitable domination of graphs
One of the most interesting facts about the study of connectivity and working is in the area of domination. By this, we determine the independent equitable domination number of some graphs and some results. Moreover, we investigate graphs with the existence of independent equitable dominating set.