Department of Mathematics, Faculty of Science, Suez Canal University, Suez, Egypt.
Mathematical Subjected Classification: 51H10, 57N10
In this paper we discussed the relation between the chromatic number and graph folding. Theorem governing this relation are achieved.We prove that if the chromatic number of a graph equal the number of its vertices then the graph cannot be folded.Also we prove that we cannot fold any connected graph when the clique number is less than the chromatic number
Chromatic number, Folding graph, Clique number
