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


Maximal independent sets in graphs with at most r cycles
Authors:Goh Chee Ying  Koh Khee Meng  Bruce E. Sagan  Vincent R. Vatter
Abstract:We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family is all graphs of the first family which are connected and satisfy n ≥ 3r. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 270–282, 2006
Keywords:cycle  ear decomposition  maximal independent set
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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