Chun-Nan Hung, Mohamad Abdallah, Jui-I Weng, Tzu-Liang Kung
{"title":"煎饼图的边环性","authors":"Chun-Nan Hung, Mohamad Abdallah, Jui-I Weng, Tzu-Liang Kung","doi":"10.1080/23799927.2020.1803972","DOIUrl":null,"url":null,"abstract":"ABSTRACT Pancylicity was introduced by Bondy in 1971. A graph G with vertex set and edge set is pancyclic if it contains cycles of lengths l, for . This concept has been extended to edge-pancyclicity. If every edge of G is in a cycle of every length, G is edge-pancyclic. If every edge lies on cycles of all lengths ranging from k to , G is k-edge-pancyclic. In this paper, we prove that the n-dimensional pancake graph is 7-edge-pancyclic.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"49 1","pages":"125 - 133"},"PeriodicalIF":0.9000,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Edge-pancyclicity of pancake graph\",\"authors\":\"Chun-Nan Hung, Mohamad Abdallah, Jui-I Weng, Tzu-Liang Kung\",\"doi\":\"10.1080/23799927.2020.1803972\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT Pancylicity was introduced by Bondy in 1971. A graph G with vertex set and edge set is pancyclic if it contains cycles of lengths l, for . This concept has been extended to edge-pancyclicity. If every edge of G is in a cycle of every length, G is edge-pancyclic. If every edge lies on cycles of all lengths ranging from k to , G is k-edge-pancyclic. In this paper, we prove that the n-dimensional pancake graph is 7-edge-pancyclic.\",\"PeriodicalId\":37216,\"journal\":{\"name\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"volume\":\"49 1\",\"pages\":\"125 - 133\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2020-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/23799927.2020.1803972\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2020.1803972","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
ABSTRACT Pancylicity was introduced by Bondy in 1971. A graph G with vertex set and edge set is pancyclic if it contains cycles of lengths l, for . This concept has been extended to edge-pancyclicity. If every edge of G is in a cycle of every length, G is edge-pancyclic. If every edge lies on cycles of all lengths ranging from k to , G is k-edge-pancyclic. In this paper, we prove that the n-dimensional pancake graph is 7-edge-pancyclic.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
