English  |  正體中文  |  简体中文  |  Items with full text/Total items : 16812/19099 (88%)
Visitors : 6806746      Online Users : 625
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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://ir.cnu.edu.tw/handle/310902800/28713


    標題: The Number of Spanning Trees of the Cartesian Product of Regular Graphs
    作者: Wu, Mei-Hui
    Chung, Long-Yeu
    貢獻者: 通識教育中心
    資訊多媒體應用系
    關鍵字: DIRECTED CIRCULANT GRAPHS
    K-N-COMPLEMENTS
    CHEBYSHEV POLYNOMIALS
    NETWORKS
    CONNECTIVITY
    FORMULAS
    日期: 2014
    上傳時間: 2015-05-06 21:26:07 (UTC+8)
    出版者: Hindawi Publishing Corporation
    摘要: The number of spanning trees in graphs or in networks is an important issue. The evaluation of this number not only is interesting from a mathematical (computational) perspective but also is an important measure of reliability of a network or designing electrical circuits. In this paper, a simple formula for the number of spanning trees of the Cartesian product of two regular graphs is investigated. Using this formula, the number of spanning trees of the four well-known regular networks can be simply taken into evaluation.
    關聯: Mathematical Problems In Engineering, 750618
    Appears in Collections:[資訊多媒體應用系] 期刊論文
    [通識教育中心] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML389View/Open


    All items in CNU IR are protected by copyright, with all rights reserved.


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