单圈图伴随多项式极小根(英文).docVIP

单圈图伴随多项式极小根(英文) 　　AbstractThe adjoint polynomial was introduced for solving the chromaticity problem of the complements of graphs. The minimum roots of the adjoint polynomials of graphs can be applied to sort out graphs that are not chromatically equivalent. Letβ（G） be the minimum root of the adjoint polynomial of the graph G. Denote by？n the set of all unicyclic graphs on n vertices. All graphs with max{β（G）|G∈？n}（resp. min{β（G）|G∈？n}） are determined. 　　Key wordsChromatic polynomial； Adjoint polynomial； Unicyclic graphs； Roots 　　CLC numberO 157.5Document codeA 　　1Introduction 　　All the graphs considered here arefinite， undirected and simple. Undefined notation and terminology will refer to those in [1]. Let G be a graph， and G， V （G） and E（G）， respectively， be the complement， the vertex set and the edge set of G. The chromatic polynomial of G is defined as[2] 　　George David Birkhoffintroduced the chromatic polynomial in 1912， defining it only for planar graphs， in an attempt to prove the four color theorem. In 1968 Read asked which polynomials are the chromatic polynomials of some graph， a question that remains open， and introduced the concept of chromatically equivalent graphs[2]. Today， chromatic polynomials are one of the central objects of algebraic graph theory. The adjoint polynomial was introduced for solving the chromaticity problem of the complements of graphs[3，4]. For a survey of the mathematical properties and related results see the review [4]. Letβ（G） be the minimum root of the adjoint polynomial of the graph G. The minimum roots of the adjoint polynomials of graphs can be applied to sort out graphs that are not chromatically equivalent. In[5？8]， the authors studied the minimum real roots of the adjoint polynomials of some graphs， many new classes of chromatically unique（chromatically equivalent） graphs had been obtained by comparing the minimum roots of their adjoint polynomials. Thus， it is useful tofind the extremal values ofβ（G） for signifi