首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Feedback numbers of Kautz digraphs
Authors:Jun-Ming Xu  Ye-Zhou Wu  Jia Huang  Chao Yang
Institution:Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, China
Abstract:A subset of vertices (resp. arcs) of a graph G is called a feedback vertex (resp. arc) set of G if its removal results in an acyclic subgraph. Let f(d,n) (fa(d,n)) denote the minimum cardinality over all feedback vertex (resp. arc) sets of the Kautz digraph K(d,n). This paper proves that for any integers d?2 and n?1
View the MathML source
Keywords:05C85  68R10
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号