On cocoloring of corona of graphs
Downloads
DOI:
https://doi.org/10.26637/MJM0801/0020Abstract
A $k$-cocoloring of a graph $G$ is a partition of the vertex set into $k$ subsets such that each set induces either a clique or an independent set in $G$. The cochromatic number $z(G)$ of a graph $G$ is the least $k$ such that $G$ has a $k$-cocoloring of $G$. In this paper, we give exact bounds of the cochromatic number for the corona product of Path graph with $P_n, K_n, C_n, K_{1, n}$.
Keywords:
Cocoloring, Cochromatic number, Corona.Mathematics Subject Classification:
Mathematics- Pages: 122-124
- Date Published: 01-01-2020
- Vol. 8 No. 01 (2020): Malaya Journal of Matematik (MJM)
Erdos P, Gimbel J and Straight J, Chromatic Number Versus Cochromatic Number in Graphs with Bounded Clique number, J. Combinatories (1990), 11, 235-240.
Frucht R and Harary F, On the corona of two graphs, Aequationess Math., 4(1970), 322-325.
Gimbel J, The chromatic and cochromatic number of a graph, Doctoral Thesis, Western Michigan University, Kalamazoo, MI(1984).
Harar F, Graph Theory, Addison-Wesley Publishing Co., Reading, Mass-Menlo Park. Calif- London, 1969.
Klavzhar S, Hammack R and Imrich W, Handbook of Graph Product,CRC Press, 2011.
Lesniak L and Straight H.J, The Cochromatic number of a graph, Ars Combin, 3(1973), 39-40.
Similar Articles
- D. K. Thakkar, P. Jamvecha, On ve-quasi and secured ve-quasi independent sets of a graph , Malaya Journal of Matematik: Vol. 8 No. 01 (2020): Malaya Journal of Matematik (MJM)
You may also start an advanced similarity search for this article.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.
