Equitable Coloring on Total Graph of Bigraphs and Central Graph of Cycles and Paths
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interesting results regarding the equitable chromatic number 𝜒= for the total graph of complete bigraphs 𝑇(𝐾𝑚,𝑛), the central graph of cycles 𝐶(𝐶𝑛) and the central graph of paths 𝐶(𝑃𝑛)....
Saved in:
| Main Authors: | J. Vernold Vivin, K. Kaliraj, M. M. Akbar Ali |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2011-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2011/279246 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Total fuzzy graph coloring
by: Smriti Saxena, et al.
Published: (2023-06-01) -
Equitable choosability of prism graphs
by: Kirsten Hogenson, et al.
Published: (2025-01-01) -
Divisor equitably strong non-split divisor equitable domination in graphs
by: Priyanka G. B., et al.
Published: (2025-02-01) -
2-Quasitotal Fuzzy Graphs and Their Total Coloring
by: V. N. Srinivasa Rao Repalle, et al.
Published: (2020-01-01) -
General Vertex-Distinguishing Total Coloring of Graphs
by: Chanjuan Liu, et al.
Published: (2014-01-01)