Equitable coloring on total graph of bigraphs and central graph of cycles and paths (Q539352)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5900715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equitable coloring on total graph of bigraphs and central graph of cycles and paths |
scientific article; zbMATH DE number 5900715 |
Statements
Equitable coloring on total graph of bigraphs and central graph of cycles and paths (English)
0 references
27 May 2011
0 references
Summary: The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interesting results regarding the equitable chromatic number \(\chi_=\) for the total graph of complete bigraphs \(T (K_{m,n})\), the central graph of cycles \(C (C_n)\) and the central graph of paths \(C(P_n)\).
0 references
equitable chromatic number
0 references
total graph
0 references
complete bigraphs
0 references
central graph of cycles
0 references
0 references
0.9247652888298036
0 references
0.8766301274299622
0 references
0.8724837899208069
0 references
0.8652278780937195
0 references
