English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69561/69561 (100%)
Visitors : 23256528      Online Users : 433
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
    NCU Institutional Repository > 理學院 > 數學系 > 期刊論文 >  Item 987654321/51211


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/51211


    Title: Spiders are status unique in trees
    Authors: Shang,JL;Lin,C
    Contributors: 數學系
    Keywords: DISTANCE;GRAPHS
    Date: 2011
    Issue Date: 2012-03-27 18:25:05 (UTC+8)
    Publisher: 國立中央大學
    Abstract: The status of a vertex x in a graph is the sum of the distances between x and all other vertices. The status sequence of a graph is the list of the statuses of all vertices arranged in nondecreasing order. It is well known that non-isomorphic trees may have the same status sequence. A graph G is said to be status unique in a family F of graphs if G is a member of F and G is uniquely determined in F by its status sequence. The main result of this paper is that every spider is status unique in the family of all trees. Some conjectures about status unique graphs are proposed at the end of the paper. (C) 2011 Elsevier B.V. All rights reserved.
    Relation: DISCRETE MATHEMATICS
    Appears in Collections:[數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML419View/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  - 隱私權政策聲明