# The chromatic equivalence class of graph $\overline{{B}_{n-6,1,2}}$

Jianfeng Wang; Qiongxiang Huang; Chengfu Ye; Ruying Liu

Discussiones Mathematicae Graph Theory (2008)

- Volume: 28, Issue: 2, page 189-218
- ISSN: 2083-5892

## Access Full Article

top## Abstract

top## How to cite

topJianfeng Wang, et al. "The chromatic equivalence class of graph $\overline{B_{n-6,1,2}}$." Discussiones Mathematicae Graph Theory 28.2 (2008): 189-218. <http://eudml.org/doc/270688>.

@article{JianfengWang2008,

abstract = {By h(G,x) and P(G,λ) we denote the adjoint polynomial and the chromatic polynomial of graph G, respectively. A new invariant of graph G, which is the fourth character R₄(G), is given in this paper. Using the properties of the adjoint polynomials, the adjoint equivalence class of graph $B_\{n-6,1,2\}$ is determined, which can be regarded as the continuance of the paper written by Wang et al. [J. Wang, R. Liu, C. Ye and Q. Huang, A complete solution to the chromatic equivalence class of graph $\overline\{B_\{n-7,1,3\}\}$, Discrete Math. (2007), doi: 10.1016/j.disc.2007.07.030]. According to the relations between h(G,x) and P(G,λ), we also simultaneously determine the chromatic equivalence class of $\overline\{B_\{n-6,1,2\}\}$ that is the complement of $B_\{n-6,1,2\}$.},

author = {Jianfeng Wang, Qiongxiang Huang, Chengfu Ye, Ruying Liu},

journal = {Discussiones Mathematicae Graph Theory},

keywords = {chromatic equivalence class; adjoint polynomial; the smallest real root; the second smallest real root; the fourth character; samllest real root; second smallest real root; fourth character},

language = {eng},

number = {2},

pages = {189-218},

title = {The chromatic equivalence class of graph $\overline\{B_\{n-6,1,2\}\}$},

url = {http://eudml.org/doc/270688},

volume = {28},

year = {2008},

}

TY - JOUR

AU - Jianfeng Wang

AU - Qiongxiang Huang

AU - Chengfu Ye

AU - Ruying Liu

TI - The chromatic equivalence class of graph $\overline{B_{n-6,1,2}}$

JO - Discussiones Mathematicae Graph Theory

PY - 2008

VL - 28

IS - 2

SP - 189

EP - 218

AB - By h(G,x) and P(G,λ) we denote the adjoint polynomial and the chromatic polynomial of graph G, respectively. A new invariant of graph G, which is the fourth character R₄(G), is given in this paper. Using the properties of the adjoint polynomials, the adjoint equivalence class of graph $B_{n-6,1,2}$ is determined, which can be regarded as the continuance of the paper written by Wang et al. [J. Wang, R. Liu, C. Ye and Q. Huang, A complete solution to the chromatic equivalence class of graph $\overline{B_{n-7,1,3}}$, Discrete Math. (2007), doi: 10.1016/j.disc.2007.07.030]. According to the relations between h(G,x) and P(G,λ), we also simultaneously determine the chromatic equivalence class of $\overline{B_{n-6,1,2}}$ that is the complement of $B_{n-6,1,2}$.

LA - eng

KW - chromatic equivalence class; adjoint polynomial; the smallest real root; the second smallest real root; the fourth character; samllest real root; second smallest real root; fourth character

UR - http://eudml.org/doc/270688

ER -

## References

top- [1] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North-Holland, Amsterdam, 1976). Zbl1226.05083
- [2] F.M. Dong, K.M. Koh, K.L. Teo, C.H.C. Little and M.D. Hendy, Two invariants for adjointly equivalent graphs, Australasian J. Combin. 25 (2002) 133-143. Zbl0993.05067
- [3] F.M. Dong, K.L. Teo, C.H.C. Little and M.D. Hendy, Chromaticity of some families of dense graphs, Discrete Math. 258 (2002) 303-321, doi: 10.1016/S0012-365X(02)00355-2. Zbl1010.05024
- [4] Q.Y. Du, The graph parameter π (G) and the classification of graphs according to it, Acta Sci. Natur. Univ. Neimonggol 26 (1995) 258-262.
- [5] B.F. Huo, Relations between three parameters A(G), R(G) and D₂(G) of graph G (in Chinese), J. Qinghai Normal Univ. (Natur. Sci.) 2 (1998) 1-6.
- [6] K.M. Koh and K.L. Teo, The search for chromatically unique graphs, Graphs and Combin. 6 (1990) 259-285, doi: 10.1007/BF01787578. Zbl0727.05023
- [7] K.M. Koh and K.L. Teo, The search for chromatically unique graphs-II, Discrete Math. 172 (1997) 59-78, doi: 10.1016/S0012-365X(96)00269-5. Zbl0879.05031
- [8] R.Y. Liu, Several results on adjoint polynomials of graphs (in Chinese), J. Qinghai Normal Univ. (Natur. Sci.) 1 (1992) 1-6.
- [9] R.Y. Liu, On the irreducible graph (in Chinese), J. Qinghai Normal Univ. (Natur. Sci.) 4 (1993) 29-33.
- [10] R.Y. Liu and L.C. Zhao, A new method for proving uniqueness of graphs, Discrete Math. 171 (1997) 169-177, doi: 10.1016/S0012-365X(96)00078-7. Zbl0881.05046
- [11] R.Y. Liu, Adjoint polynomials and chromatically unique graphs, Discrete Math. 172 (1997) 85-92, doi: 10.1016/S0012-365X(96)00271-3. Zbl0878.05030
- [12] J.S. Mao, Adjoint uniqueness of two kinds of trees (in Chinese), The thesis for Master Degree (Qinghai Normal University, 2004).
- [13] R.C. Read and W.T. Tutte, Chromatic Polynomials, in: L.W. Beineke, R.T. Wilson (Eds), Selected Topics in Graph Theory III (Academiv Press, New York, 1988) 15-42. Zbl0667.05022
- [14] S.Z. Ren, On the fourth coefficients of adjoint polynomials of some graphs (in Chinese), Pure and Applied Math. 19 (2003) 213-218. Zbl1123.05301
- [15] J.F. Wang, R.Y. Liu, C.F. Ye and Q.X. Huang, A complete solution to the chromatic equivalence class of graph $\overline{{B}_{n-7,1,3}}$, Discrete Math. 308 (2008) 3607-3623. Zbl1225.05136
- [16] C.F. Ye, The roots of adjoint polynomials of the graphs containing triangles, Chin. Quart. J. Math. 19 (2004) 280-285.
- [17] H.X. Zhao, Chromaticity and Adjoint Polynomials of Graphs, The thesis for Doctor Degree (University of Twente, 2005). The Netherlands, Wöhrmann Print Service (available at http://purl.org/utwente/50795)

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.