English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67621/67621 (100%)
Visitors : 23115344      Online Users : 341
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.lib.ncu.edu.tw/handle/987654321/33604


    Title: Steiner centers and Steiner medians of graphs
    Authors: Yeh,Hong-Gwa;Chiang,Chun-Ying;Peng,Sheng-Hueng
    Contributors: 數學研究所
    Keywords: DISTANCE-HEREDITARY GRAPHS
    Date: 2008
    Issue Date: 2010-07-07 11:39:34 (UTC+8)
    Publisher: 中央大學
    Abstract: Let G be a connected graph and S a set of vertices of G. The Steiner distance of S is the smallest number of edges in a connected subgraph of G that contains S and is denoted by d(G) (S) or d(S). The Steiner n-eccentricity e(n) (v) and Steiner n-distance
    Relation: DISCRETE MATHEMATICS????
    Appears in Collections:[數學研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML348View/Open


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

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明