{"title":"路径图的电晕积与扇形图的二次幂的Cordial标记","authors":"A. Elrokh, S. Nada, E. El-Shafey","doi":"10.4236/OJDM.2021.112003","DOIUrl":null,"url":null,"abstract":"A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we construct the corona between paths and second power of fan graphs and explain the necessary and sufficient conditions for this construction to be cordial.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Cordial Labeling of Corona Product of Path Graph and Second Power of Fan Graph\",\"authors\":\"A. Elrokh, S. Nada, E. El-Shafey\",\"doi\":\"10.4236/OJDM.2021.112003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we construct the corona between paths and second power of fan graphs and explain the necessary and sufficient conditions for this construction to be cordial.\",\"PeriodicalId\":61712,\"journal\":{\"name\":\"离散数学期刊(英文)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"离散数学期刊(英文)\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.4236/OJDM.2021.112003\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"离散数学期刊(英文)","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.4236/OJDM.2021.112003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cordial Labeling of Corona Product of Path Graph and Second Power of Fan Graph
A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we construct the corona between paths and second power of fan graphs and explain the necessary and sufficient conditions for this construction to be cordial.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
