{"title":"Fair Secure Dominating Set in the Corona of Graphs","authors":"Lorelyn P. Gomez, Enrico L. Enriquez","doi":"10.2139/ssrn.3646011","DOIUrl":null,"url":null,"abstract":"In this paper, we extend the concept of fair secure dominating sets by characterizing the corona of two nontrivial connected graphs and give some important results.","PeriodicalId":443021,"journal":{"name":"Engineering Educator: Courses","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Educator: Courses","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3646011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we extend the concept of fair secure dominating sets by characterizing the corona of two nontrivial connected graphs and give some important results.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
