{"title":"有限环数有向图中的弧反转","authors":"Z. R. Bogdanowicz","doi":"10.47443/cm.2022.014","DOIUrl":null,"url":null,"abstract":"Let C G be a longest cycle in the directed graph G = ( V, A ) . Let q be the total number of cycles in G . It is proved that if 1 ≤ q ≤ | V ( C G ) | then there exists an arc a ∈ A ( G ) whose reversal decreases the total number of cycles in G .","PeriodicalId":48938,"journal":{"name":"Contributions To Discrete Mathematics","volume":"11 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2022-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Arc Reversal in Digraphs With a Restricted Number of Cycles\",\"authors\":\"Z. R. Bogdanowicz\",\"doi\":\"10.47443/cm.2022.014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let C G be a longest cycle in the directed graph G = ( V, A ) . Let q be the total number of cycles in G . It is proved that if 1 ≤ q ≤ | V ( C G ) | then there exists an arc a ∈ A ( G ) whose reversal decreases the total number of cycles in G .\",\"PeriodicalId\":48938,\"journal\":{\"name\":\"Contributions To Discrete Mathematics\",\"volume\":\"11 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Contributions To Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.47443/cm.2022.014\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Contributions To Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.47443/cm.2022.014","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
设C G是有向图G = (V, a)中的最长环。设q为G中循环的总数。证明了如果1≤q≤| V (C G) |则存在一个弧a∈a (G),其反转使G中的总圈数减小。
On Arc Reversal in Digraphs With a Restricted Number of Cycles
Let C G be a longest cycle in the directed graph G = ( V, A ) . Let q be the total number of cycles in G . It is proved that if 1 ≤ q ≤ | V ( C G ) | then there exists an arc a ∈ A ( G ) whose reversal decreases the total number of cycles in G .
期刊介绍:
Contributions to Discrete Mathematics (ISSN 1715-0868) is a refereed e-journal dedicated to publishing significant results in a number of areas of pure and applied mathematics. Based at the University of Calgary, Canada, CDM is free for both readers and authors, edited and published online and will be mirrored at the European Mathematical Information Service and the National Library of Canada.