{"title":"一些特殊图的斐波那契诚恳标记","authors":"A. Rokad","doi":"10.13005/OJCST/10.04.18","DOIUrl":null,"url":null,"abstract":"An injective function g: V(G) → {F 0 , F 1 , F 2 , . . . , F n+1 }, where Fj is the jth Fibonacci number (j = 0, 1, . . . , n+1), is said to be Fibonacci cordial labeling if the induced function g*: E(G) → {0, 1} defined by g * (xy) = (f (x) + f (y)) (mod2) satisfies the condition |e g (1) − e g (0)| ≤ 1. A graph having Fibonacci cordial labeling is called Fibonacci cordial graph. In this paper, i inspect the existence of Fibonacci Cordial Labeling of DS(Pn), DS(DFn), Edge duplication in K 1,n , Joint sum of Gl(n), DFn⊕ K 1,n and ringsum of star graph with cycle with one chord and cycle with two chords respectively.","PeriodicalId":270258,"journal":{"name":"Oriental journal of computer science and technology","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Fibonacci Cordial Labeling of Some Special Graphs\",\"authors\":\"A. Rokad\",\"doi\":\"10.13005/OJCST/10.04.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An injective function g: V(G) → {F 0 , F 1 , F 2 , . . . , F n+1 }, where Fj is the jth Fibonacci number (j = 0, 1, . . . , n+1), is said to be Fibonacci cordial labeling if the induced function g*: E(G) → {0, 1} defined by g * (xy) = (f (x) + f (y)) (mod2) satisfies the condition |e g (1) − e g (0)| ≤ 1. A graph having Fibonacci cordial labeling is called Fibonacci cordial graph. In this paper, i inspect the existence of Fibonacci Cordial Labeling of DS(Pn), DS(DFn), Edge duplication in K 1,n , Joint sum of Gl(n), DFn⊕ K 1,n and ringsum of star graph with cycle with one chord and cycle with two chords respectively.\",\"PeriodicalId\":270258,\"journal\":{\"name\":\"Oriental journal of computer science and technology\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Oriental journal of computer science and technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.13005/OJCST/10.04.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Oriental journal of computer science and technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.13005/OJCST/10.04.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
摘要
一个内射函数g: V(g)→{f0, f1, f2，…， F n+1}，其中Fj是第j个斐波那契数(j = 0,1，…)， n+1)，如果由g* (xy) = (f (x) + f (y)) (mod2)定义的诱导函数g*: E(g)→{0,1}满足条件| E g(1)−E g(0)|≤1，则称其为斐波那契诚恳标记。具有斐波那契诚恳标记的图称为斐波那契诚恳图。本文分别检验了DS(Pn)、DS(DFn)、k1,n上的边重复、Gl(n)、DFn⊕k1,n的联合和和单弦环星图和双弦环星图的环和的存在性。
An injective function g: V(G) → {F 0 , F 1 , F 2 , . . . , F n+1 }, where Fj is the jth Fibonacci number (j = 0, 1, . . . , n+1), is said to be Fibonacci cordial labeling if the induced function g*: E(G) → {0, 1} defined by g * (xy) = (f (x) + f (y)) (mod2) satisfies the condition |e g (1) − e g (0)| ≤ 1. A graph having Fibonacci cordial labeling is called Fibonacci cordial graph. In this paper, i inspect the existence of Fibonacci Cordial Labeling of DS(Pn), DS(DFn), Edge duplication in K 1,n , Joint sum of Gl(n), DFn⊕ K 1,n and ringsum of star graph with cycle with one chord and cycle with two chords respectively.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
