On the sigma chromatic number of the join of a finite number of paths and cycles
Authors:
- 19 December 2019
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Asian-European Journal of Mathematics
- Vol. 14 (02)
Abstract
Let [ ] be a simple connected graph and [ ] a coloring of the vertices in [ ] For any [ ], let [ ] be the sum of colors of the vertices adjacent to [ ]. Then [ ] is called a sigma coloring of [ ] if for any two adjacent vertices [ ]. The minimum number of colors needed in a sigma coloring of [ ] is the sigma chromatic number of [ ], denoted by [ ] In this paper, we prescribe a sigma coloring of the join of paths and cycles. As a consequence, we determine the sigma chromatic number of the join of a finite number of paths and cycles. In particular, let [ ], where [ ] or [ ] with [ ] If [ ], where [ ] and [ ], then [ ] if [ ] is an odd cycle, for some [ ] and [ ] otherwise.Keywords
This publication has 3 references indexed in Scilit: