English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 58323/91877 (63%)
造访人次 : 14306663      在线人数 : 136
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/102845

    题名: Decomposition of Complete graphs into Triangles and Claws
    作者: Fu, Chin-Mei;Lin, Yuan-Lung;Lo, Shu-Wen;Hsu, Yu-Fong
    贡献者: 淡江大學數學學系
    关键词: Graph decomposition;Complete graph;Cycle;Star
    日期: 2014
    上传时间: 2015-05-06 16:51:09 (UTC+8)
    出版者: Taipei: Mathematical Society of the Republic of China
    摘要: Let Kn be a complete graph with n vertices, Ck denote a cycle of length k, and Sk denote a star with k edges. If k=3, then we call C3 a triangle and S3 a claw. In this paper, we show that for any nonnegative integers p and q and any positive integer n, there exists a decomposition of Kn into p copies of C3 and q copies of S3 if and only if 3(p+q)=(n2), q≠1,2 if n is odd, q=1 if n=4, and q≥max{3,⌈n4⌉} if n is even and n≥6.
    關聯: Taiwanese Journal of Mathematics 18(5), pp.1563-1581
    DOI: 10.11650/tjm.18.2014.3169
    显示于类别:[數學學系暨研究所] 期刊論文


    档案 描述 大小格式浏览次数
    Decomposition of Complete graphs into Triangles and Claws.pdf288KbAdobe PDF0检视/开启



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈