{"title":"独占图:标签之间的新链接","authors":"Rikio Ichishima, F. Muntaner-Batle, Akito Oshima","doi":"10.19184/IJC.2019.3.1.1","DOIUrl":null,"url":null,"abstract":"In this paper, we define a strongly felicitous graph to be lower-exclusive, upper-exclusive and exclusive depending on different restrictions for the vertex labels. With these new concepts, we show that the union of finite collection of strongly felicitous graphs, a lower-exclusive one and an upper-exclusive one results in a strongly felicitous graph. We also introduce the concept of decompositional graphs. By means of this, we provide some results involving the cartesian products of exclusive graphs.","PeriodicalId":13506,"journal":{"name":"Indonesian Journal of Combinatorics","volume":"237 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Exclusive graphs: a new link among labelings\",\"authors\":\"Rikio Ichishima, F. Muntaner-Batle, Akito Oshima\",\"doi\":\"10.19184/IJC.2019.3.1.1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we define a strongly felicitous graph to be lower-exclusive, upper-exclusive and exclusive depending on different restrictions for the vertex labels. With these new concepts, we show that the union of finite collection of strongly felicitous graphs, a lower-exclusive one and an upper-exclusive one results in a strongly felicitous graph. We also introduce the concept of decompositional graphs. By means of this, we provide some results involving the cartesian products of exclusive graphs.\",\"PeriodicalId\":13506,\"journal\":{\"name\":\"Indonesian Journal of Combinatorics\",\"volume\":\"237 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Indonesian Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.19184/IJC.2019.3.1.1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indonesian Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19184/IJC.2019.3.1.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we define a strongly felicitous graph to be lower-exclusive, upper-exclusive and exclusive depending on different restrictions for the vertex labels. With these new concepts, we show that the union of finite collection of strongly felicitous graphs, a lower-exclusive one and an upper-exclusive one results in a strongly felicitous graph. We also introduce the concept of decompositional graphs. By means of this, we provide some results involving the cartesian products of exclusive graphs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
