|
OALib Journal期刊
ISSN: 2333-9721
费用：99美元
|
|
|
|
一类图色等价的充分必要条件
, PP. 1-6
Keywords: 色多项式,伴随多项式,色等价,伴随等价
Abstract:
给出了两个伴随最小实根不小于\,$-$4\,的图伴随等价的一个充分必要条件.据此,也给出了这些图的补图色等价的一个充分必要条件.
| [1] | DOFG F M, TEO K L, LITTLE C H C, et al. Chromaticity of some
|
| [2] | families of dense graphs[J]. Discrete Math, 2002, 258: 303-321.
|
| [3] | {3}
|
| [4] | LIU R Y. A new method to find chromatic polynomial of graph and its
|
| [5] | applications[J]. Kexue Tongbao, 1987, 32: 1508-1509 (In Chinese,
|
| [6] | English summary).
|
| [7] | {4}
|
| [8] | KORFHAGE R R. $\sigma$-polynomials and graph coloring[J]. J Combin
|
| [9] | Theory Ser B, 1978, 24: 137-153.
|
| [10] | {5}
|
| [11] | DONG F M, KOH K M, TEO K L. Chromatic Polynomials and Chromaticity
|
| [12] | of Graphs[M]. Singapore: World Scientific Publishing, 2005.
|
| [13] | {6}
|
| [14] | ZHAO H X, LI X L, ZHANG S G, et al. On the minimum real root of the
|
| [15] | polynomial and chromatic uniqueness of graphs[J]. Discrete Math,
|
| [16] | {7}
|
| [17] | MA H C, REN H Z. The chromatic equivalence classes of the
|
| [18] | complements of graphs with the minimum real roots of their adjoint
|
| [19] | polynomials greater than $-4$[J]. Discrete Math, 2008, 308:
|
| [20] | 30-1836.
|
| [21] | {8}
|
| [22] | LIU R Y. Adjoint polynomials and chromatically unique graphs[J].
|
| [23] | Discrete Math, 1997, 172: 85-92.
|
| [24] | {1}
|
| [25] | CHIA G F. On the chromatic equivalence class of graphs[J]. Discrete
|
| [26] | Math, 1998, 178: 15-23.
|
| [27] | {2}
|
| [28] | 04, 281: 271-294.
|
Full-Text
|
|
Contact Us
service@oalib.com QQ:3279437679 
WhatsApp +8615387084133
|
|
