English  |  正體中文  |  简体中文  |  Items with full text/Total items : 66984/66984 (100%)
Visitors : 23170608      Online Users : 470
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/28064

    Authors: DENHAM,G;LEU,MG;LIU,A
    Contributors: 數學研究所
    Date: 1993
    Issue Date: 2010-06-29 19:41:09 (UTC+8)
    Publisher: 中央大學
    Abstract: In this paper, we give two constructive proofs that all 4-stars are Skolem-graceful. A 4-star is a graph with 4 components, with at most one vertex of degree exceeding 1 per component. A graph G = (V, E) is Skolem-graceful if its vertices can be labelled 1, 2,..., Absolute value of V so that the edges are labelled 1, 2,..., Absolute value of E, where each edge-label is the absolute difference of the labels of the two end-vertices. Skolem-gracefulness is related to the classic concept of gracefulness, and the methods we develop here may be useful there.
    Appears in Collections:[數學研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    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  - 隱私權政策聲明