On the minimum real roots of the σ -polynomials and chromatic uniqueness of graphs

Discrete Mathematics

Volumn 281, Issue 1-3, 2004, Pages 277-294

  Zhao, Haixing ^a,c   Li, Xueliang ^b   Zhang, Shenggui ^a   Liu, Ruying ^c  

^a NORTHWESTERN POLYTECHNICAL UNIVERSITY   (China)

^b NANKAI UNIVERSITY   (China)

^c QINGHAI NORMAL UNIVERSITY   (China)

Author keywords

Polynomials; Adjoint polynomials; Adjointly unique; Chromatically unique; Minimum real roots

Indexed keywords

POLYNOMIALS; PROBLEM SOLVING; ROOT LOCI; SET THEORY; THEOREM PROVING;

Σ POLYNOMIALS; ADJOINT POLYNOMIALS; ADJOINTLY UNIQUE; CHROMATICALLY UNIQUE; MINIMUM REAL ROOTS;

GRAPH THEORY;

EID: 1842615961     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2003.06.010     Document Type: Article

References (18)

1. Bondy J.A., Murty U.S.R. Graph Theory with Applications. 1976;Amsterdam, North-Holland.
2. Brenti F. Expansions of chromatic polynomials and log-concavity. Trans. Amer. Math. Soc. 332(2):1992;729-756.
3. Brenti F., Royle G.F., Wagen D.G. Location of real of chromatic polynomials and related polynomial of graphs. Canad. J. Math. 46:1994;55-80.
4. C.Y. Chao, E.G. Whitehead, On Chromatic Equivalence of graphs, Springer Lecture Notes in Mathematics, Vol. 642, Springer, Berlin, 1978, pp. 121-131.
5. Dong F.M., Teo K.L., Little C.H.C., Hendy M.D. Chromaticity of some families of dense graphs. Discrete Math. 258:2002;303-321.
6. Du Q. Chromaticity of the complements of paths and cycles. Discrete Math. 162:1996;109-125.
7. Koh K.M., Teo K.L. The search for chromatically unique graphs. Graphs Combin. 6:1990;259-285.
8. Koh K.M., Teo K.L. The search for chromatically unique graphs (II). Discrete Math. 172:1997;59-78.
9. Korfhag R. σ -Polynomials and graph coloring J. Combin. Theory B. 24:1978;137-153.
10. R. Liu, A new method for finding chromatic polynomial of graphs and its applications, Kexue Tongbao (1) (1987) 77.
11. R. Liu, Adjoint polynomials of graphs, J. Qinghai Normal Univ. (3) (1990) 1-8.
12. Liu R. Adjoint polynomials and chromatically unique graphs. Discrete Math. 172:1997;85-92.
13. n-E(G) type Acta Math. Sci. 14(3):1994;316-320.
14. Liu R., Zhao L. A new method for proving chromatic uniqueness of graphs. Discrete Math. 171:1997;169-177.
15. R.P. Stanley, Enumerative Combinatorics, Vol. 1, Wadsworth and Brooks/Cole, Monterey, CA, 1986.
16. n J. Math. Res. Exposion. 18(2):1998;296.
17. H. Zhao, B. Huo, R. Liu, Chromaticity of the complement of paths, J. Math. Study (4) (2000) 345-353.
18. H. Zhao, R. Liu, The necessary and sufficient condition of the irreducible of paths, J. Northeast Normal Univ. (2) (2001) 18-21.