{"title":"路径与循环的两次四次幂的和与并的亲切性","authors":"Ashraf Elrokh, Aya Rabie","doi":"10.1186/s42787-020-00111-6","DOIUrl":null,"url":null,"abstract":"A simple graph is called cordial if it has 0-1 labeling that satisfies certain conditions. In this paper, we examine the necessary and sufficient conditions for cordial labeling of the sum and union of two fourth power of paths and cycles.\n","PeriodicalId":33345,"journal":{"name":"Journal of the Egyptian Mathematical Society","volume":"65 19","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The cordiality of the sum and union of two fourth power of paths and cycles\",\"authors\":\"Ashraf Elrokh, Aya Rabie\",\"doi\":\"10.1186/s42787-020-00111-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A simple graph is called cordial if it has 0-1 labeling that satisfies certain conditions. In this paper, we examine the necessary and sufficient conditions for cordial labeling of the sum and union of two fourth power of paths and cycles.\\n\",\"PeriodicalId\":33345,\"journal\":{\"name\":\"Journal of the Egyptian Mathematical Society\",\"volume\":\"65 19\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Egyptian Mathematical Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1186/s42787-020-00111-6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Egyptian Mathematical Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/s42787-020-00111-6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The cordiality of the sum and union of two fourth power of paths and cycles
A simple graph is called cordial if it has 0-1 labeling that satisfies certain conditions. In this paper, we examine the necessary and sufficient conditions for cordial labeling of the sum and union of two fourth power of paths and cycles.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
