On the chromatic equivalence class of graphs (Q1377862): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Gek Ling Chia / rank | |||
Property / reviewed by | |||
Property / reviewed by: Dan S. Archdeacon / rank | |||
Revision as of 04:11, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the chromatic equivalence class of graphs |
scientific article |
Statements
On the chromatic equivalence class of graphs (English)
0 references
10 August 1999
0 references
Let \(P(G, \lambda)\) denote the chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are chromatically equivalent if \(P(G,\lambda) = P(H,\lambda)\). The chromatic equivalence class of \(G\) consists of all graphs chromatically equivalent to \(G\). For example, the chromatic equivalence class of a tree consists of exactly all other trees of the same order. The join of two graphs \(G\) and \(H\) is obtained by taking a disjoint copy of each graph and adding edges from every vertex of \(G\) to every vertex of \(H\). The author determines the class of all graphs in the chromatic equivalence class of the join of \(m\) copies of paths each of length 3. He also gives two operations, which when applied to graphs in the chromatic equivalence class of \(G\), give all graphs with chromatic polynomial \(\lambda P(G,\lambda)\). A similar result is given for all graphs with chromatic polynomial \((\lambda -1) P(G,\lambda)\).
0 references
chromatic polynomial
0 references
chromatic equivalence class
0 references