Adjoint polynomials and chromatically unique graphs

Discrete Mathematics

Volumn 172, Issue 1-3, 1997, Pages 85-92

  Liu, Ru Ying ^a  

^a QINGHAI NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1842461708     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00271-3     Document Type: Article

References (29)

1. N. Biggs, Algebraic Graph Theorey (Cambridge Univ. Press, Cambridge, 1974).
2. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North-Holland, Amsterdam, 1976).
3. C.Y. Chao and E.G. Whitehead, On chromatic equivalence of graphs, Springer Lecture Notes in Mathematics, Vol. 642 (Springer, Berlin, 1978) 121-131.
4. Q.Y. Du, On σ-polynomials and a class of chromatically unique graphs, Discrete Math. 115 (1993) 153-165.
5. E.J. Farrell, An introduction to matching polynomials, J. Combin. Theory (B) 27 (1979) 75-86.
6. Z.-Y. Guo and Y.-J. Li, Chromatic uniqueness of complement of the cycles union, Kexue Tongbao 33 (1988) 1676.
7. K.M. Koh and K.L. Teo, The search for chromatically unique graphs, Graphs Combin. 6 (1990) 259-285.
8. R. Korfhage, σ-polynomials and graph coloring, J. Combin. Theory (B) 24 (1978) 137-153.
9. N.Z. Li, E.G. Whitehead and S.J. Xu, Classification of chromatically unique graphs having quadratic σ-polynomials, J. Graph Theory 11 (1987) 169-176.
10. N.Z. Li, On graphs having σ-polynomials of the same degree, Discrete Math. 110 (1992) 185-196.
11. R.-Y. Liu, A new method to find chromatic polynomial of graph and its applications, Kexue Tongbao 32 (1987) 1508-1509.
12. R.-Y. Liu, On chromatic polynomials of two classes of graphs, Kexue Tongbao 32 (1987) 1147-1148.
13. R.-Y. Liu, On chromatic polynomials of complementary graphs of trees, J. Xinjiang University 6 (1989) 6-8.
14. R.-Y. Liu, Adjoint polynomial of graphs, J. Qinghai Normal University 8 (3) (1990) 1-9.
15. t), J. Systems Sci. Math. Sci. 12 (1992) 207-214.
16. R.-Y. Liu, Several results on adjoint polynomials of graphs, J. Qinghai Normal University 10 (1992) 1-6.
17. R.-Y. Liu, On the irreducible graphs, J. Qinghai Normal University 11 (4) (1993) 29-33.
18. q-1, J. Math. Res. Exposition 14 (1994) 469-472.
19. R.-Y. Liu, Chromatic uniqueness of a kind of graph, J. Neimenggu University 25 (1994) 469-475.
20. R.-Y. Liu, Chromatic uniqueness of complement of the irreducible cycles union, Math. Appl. 7 (1994) 200-205.
21. R.-Y. Liu, Chromatic uniqueness of complementary graphs of a kind of trees, Math. Applicata Supplement 9 (1996) 170-173.
22. R.-Y. Liu and X.-W. Bao, Chromatic uniqueness of the complements of 2-regular graphs, Pure Appl. Math. Suppl (2) 9 (1993) 69-71.
23. R.-Y. Liu, Two new classes of chromatically unique graphs, J. Neimenggu University, 27 (1996) 11-17.
24. n - E(G) type, Acta Math. Scientia 14 (1994) 316-320.
25. R.-Y. Liu and J.-F. Wang, On chromatic uniqueness of complement of union of cycles and paths, Theoret. Comput. Sci. 1 (1992) 112-126.
26. R.C. Read, An introduction to chromatic polynomials, J. Combin. Theory 4 (1968) 52-71.
27. S.J. Xu, On σ-polynomials, Discrete Math. 69 (1988) 189-194.
28. C.-F. Ye and R.-Y. Liu, Chromatic uniqueness of a new family of graphs, Pure Appl. Math. 10 (1994) (special issue) 46-53.
29. R.W. Frucht, A new method of computing chromatic polynomials of graphs, in: Lecture Notes in Pure Appl. Math., Vol. 96 (1985) 69-77.