Another family of chromatically unique graphs |
| |
Authors: | Yee-Hock Peng |
| |
Institution: | (1) Department of Mathematics, University of Agriculture, 43400UPM Serdang, Malaysia |
| |
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.Research was partly supported by the University of Agriculture research grant # 50205-91-05 |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|