On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\) (Q1901034): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Onq-trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The chromaticity of wheels with a missing spoke / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The search for chromatically unique graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromaticity of two-trees / rank | |||
Normal rank |
Latest revision as of 17:56, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\) |
scientific article |
Statements
On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\) (English)
0 references
23 April 1996
0 references
Let \(P(G,\lambda)\) be the chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are said to be chromatically equivalent if \(P(G, \lambda) = P(H, \lambda)\). A graph \(G\) is chromatically unique if \(G\) is isomorphic to \(H\) for any graph \(H\) such that \(H\) and \(G\) are chromatically equivalent. Let \(W(n,n - 2)\) denote the wheel \(W_n\) with a missing spoke, and \(W(n,n - 2) + K_k\) the join of \(W(n,n - 2)\) and the complete graph \(K_k\) which is obtained from the union of \(W(n,n - 2)\) and \(K_k\). \textit{G. L. Chia} [Discrete Math. 82, No. 2, 209-212 (1990; Zbl 0712.05025)] proved that \(W(n,n-2)\) is chromatically unique for any even \(n \geq 6\). In the present paper the authors generalize this result by showing that the joint graph \(W(n,n - 2) + K_k\) is chromatically unique for any even integer \(n \geq 6\) and integer \(k \geq 0\).
0 references
chromatic uniqueness
0 references
chromatic polynomial
0 references
chromatically equivalent
0 references
chromatically unique
0 references
wheel
0 references