| You are in:Home/Publications/Perfect Folding of Graphs | |
Assist. hany ahmed mohamed abdelftah :: Publications: |
|
| Title: | Perfect Folding of Graphs |
| Authors: | E. M. El-Kholy; H. Ahmed |
| Year: | 2021 |
| Keywords: | clique number, chromatic number, perfect graphs, graph folding. |
| Journal: | Global Journal of Science Frontier Research |
| Volume: | 21 |
| Issue: | 1 |
| Pages: | Not Available |
| Publisher: | Not Available |
| Local/International: | International |
| Paper Link: | Not Available |
| Full paper | hany ahmed mohamed abdelftah_Perfect Folding of Graphs (2021).pdf |
| Supplementary materials | Not Available |
| Abstract: |
In this paper we introduced the definition of perfect folding of graphs and we proved that cycle graphs of even number of edges can be perfectly folded while that of odd number of edges can be perfectly folded to C3. Also we proved that wheel graphs of odd number of vertices can be perfectly folded to C3. Finally we proved that if G is a graph of n vertices such that 2 > clique number = chromatic number = k > n, then the graph can be perfectly folded to a clique of order k. |
