Temat: chromatic equivalence - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On chromatic equivalence of a pair of K4-homeomorphs
Autorzy:: Catada-Ghimire, S.
Roslan, H.
Peng, Y. H.
Powiązania:: https://bibliotekanauki.pl/articles/255920.pdf
Data publikacji:: 2010
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: chromatic polynomial
chromatic equivalence
K4-homeomorphs
Opis:: Let P(G, λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically euqivalent, denoted G ∼ H, if P(G, λ) = P(H, λ). We write [G] = {H/H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we discuss a chromatically equivalent pair of graphs in one family of K4-homeomorphs, K4(1, 2, 8, d, e, f). The obtained result can be extended in the study of chromatic equivalence classes of K4(1, 2, 8, d, e, f) and chromatic uniqueness of K4-homeomorphs with girth 11.
Źródło:: Opuscula Mathematica; 2010, 30, 2; 123-131
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: The chromatic equivalence class of graph $\overline{B_{n-6,1,2}}$
Autorzy:: Wang, Jianfeng
Huang, Qiongxiang
Ye, Chengfu
Liu, Ruying
Powiązania:: https://bibliotekanauki.pl/articles/743311.pdf
Data publikacji:: 2008
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: chromatic equivalence class
adjoint polynomial
the smallest real root
the second smallest real root
the fourth character
Opis:: 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}$.
Źródło:: Discussiones Mathematicae Graph Theory; 2008, 28, 2; 189-218
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja