Skip to main content
SpringerLink
Log in

Another family of chromatically unique graphs

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

LetP(G; λ) denote the chromatic polynomial of a graphG, expressed in the variableλ. ThenG is said to be chromatically unique ifG is isomorphic withH for any graphH such thatP(H; λ) = P(G; λ). In this paper, we provide a new family of chromatically unique graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chao, C.Y., Whitehead Jr., E.G.; On the chromatic equivalence of graphs, Lecture Notes in Math.642, Springer-Verlag, New York 121–131 (1978)

    Google Scholar 

  2. Chao, C.Y., Zhao, L.C.; Chromatic polynomials of a family of graphs, Ars Combinatoria15, 111–129 (1983)

    Google Scholar 

  3. Chia, G.L.; Personal communication

  4. Loerinc, B.; Chromatic Uniqueness of the generalizedθ-graph, Discrete Math.23, 313–316 (1979)

    Google Scholar 

  5. Koh, K.M., Teo, K.L.; The search for chromatically unique graphs, Graphs and Combinatorics6, 259–285 (1990)

    Google Scholar 

  6. Peng, Y.H.; New infinite families of chromatically unique graphs, Sains Malaysiana (Quantitative Studies)21(4, 15–25 (1992)

    Google Scholar 

  7. Read, R.C.; Broken Wheel are SLC, Ars Combinatoria21-A, 123–128 (1986)

    Google Scholar 

  8. ——; An introduction to chromatic polynomials, J. Combinatorial Theory4, 52–71 (1968)

    Google Scholar 

  9. Xu, S.J., Liu, J.J., Peng, Y.H.; The chromaticity ofs-bridge graphs and related graphs, Discrete Mathematics (to be published)

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Agriculture, 43400UPM, Serdang, Malaysia

    Yee-Hock Peng

Authors
  1. Yee-Hock Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research was partly supported by the University of Agriculture research grant # 50205-91-05

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peng, YH. Another family of chromatically unique graphs. Graphs and Combinatorics 11, 285–291 (1995). https://doi.org/10.1007/BF01793016

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01793016

Keywords

Search

Navigation