煎饼图的边环性

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS

International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2020-07-02 DOI:10.1080/23799927.2020.1803972

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":null,"pages":null},"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\":null,\"pages\":null},\"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}

引用次数: 2

摘要

邦迪于1971年提出了全环性。具有顶点集和边集的图G是泛环，如果它包含长度为l的环，对于。这个概念已经扩展到边环。如果G的每条边都在一个任意长度的环中，则G是边环。如果每条边都位于从k到的所有长度的环上，则G是k边环。本文证明了n维煎饼图是7边环。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Edge-pancyclicity of pancake graph

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Computer Mathematics: Computer Systems Theory Computer Science-Computational Theory and Mathematics

CiteScore

1.80

自引率

0.00%

发文量