• DocumentCode
    2612676
  • Title

    A Family of Chromatically Unique k-Bridge Graphs

  • Author

    Khalaf, Abdollhossein ; Hock, Peng Yee

  • Author_Institution
    Dept. of Math., Univ. Putra Malaysia, Serdang, Malaysia
  • fYear
    2009
  • fDate
    17-20 April 2009
  • Firstpage
    212
  • Lastpage
    213
  • Abstract
    Let P (G, lambda) denotes the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G ~ H, if P (G, lambda) = P (H, lambda). A graph G is chromatically unique written chi-unique, if for any graph H, G ~ H implies that G is isomorphic with H. In this paper we prove the chromatic uniqueness of a new family of k-bridge graphs.
  • Keywords
    graph theory; chromatic polynomial; chromatically unique k-bridge graph; isomorphic; Chaos; Computer science; Mathematics; Polynomials; Springs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Information Technology - Spring Conference, 2009. IACSITSC '09. International Association of
  • Conference_Location
    Singapore
  • Print_ISBN
    978-0-7695-3653-8
  • Type

    conf

  • DOI
    10.1109/IACSIT-SC.2009.125
  • Filename
    5169342
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2612676