English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51258/86283 (59%)
Visitors : 8032905      Online Users : 129
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/102845


    Title: Decomposition of Complete graphs into Triangles and Claws
    Authors: Fu, Chin-Mei;Lin, Yuan-Lung;Lo, Shu-Wen;Hsu, Yu-Fong
    Contributors: 淡江大學數學學系
    Keywords: Graph decomposition;Complete graph;Cycle;Star
    Date: 2014
    Issue Date: 2015-05-06 16:51:09 (UTC+8)
    Publisher: Taipei: Mathematical Society of the Republic of China
    Abstract: 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.
    Relation: Taiwanese Journal of Mathematics 18(5), pp.1563-1581
    Appears in Collections:[數學學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML138View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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