• DocumentCode
    2848220
  • Title

    On the Gracefulness of Disjoint Union Graph C4n, C4n and Pm

  • Author

    Zhang, Zhishang ; Wang, Chunyue

  • Author_Institution
    Sch. of Appl. Sci., Jilin Teacher´´s Inst. of Eng. & Technol., Changchun, China
  • fYear
    2009
  • fDate
    19-20 Dec. 2009
  • Firstpage
    1
  • Lastpage
    3
  • Abstract
    The graph C4n is a 4n-cycle with 4n vertexes and the graph Pm is a path with m+1 vertexes. Furthermore, The graph C4n ¿C4n ¿Pm denotes the disjoint union of two copies C4n and Pm. In this paper, the graph C4n ¿C4n ¿Pm is proved to be graceful for all n and m = 1 or m¿n + 2.
  • Keywords
    graph theory; disjoint union graph; vertexes; Labeling; Terminology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Engineering and Computer Science, 2009. ICIECS 2009. International Conference on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-1-4244-4994-1
  • Type

    conf

  • DOI
    10.1109/ICIECS.2009.5365211
  • Filename
    5365211
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2848220