Perfect folding of graphs
El-Kholy, E., Ahmed, H. (2019). Perfect folding of graphs. EKB Journal Management System, 40(1), 30-35. doi: 10.21608/djs.2019.139192
E. M. El-Kholy; H. Ahmed. "Perfect folding of graphs". EKB Journal Management System, 40, 1, 2019, 30-35. doi: 10.21608/djs.2019.139192
El-Kholy, E., Ahmed, H. (2019). 'Perfect folding of graphs', EKB Journal Management System, 40(1), pp. 30-35. doi: 10.21608/djs.2019.139192
El-Kholy, E., Ahmed, H. Perfect folding of graphs. EKB Journal Management System, 2019; 40(1): 30-35. doi: 10.21608/djs.2019.139192

Perfect folding of graphs

Delta Journal of Science
Article 4, Volume 40, Issue 1, June 2019, Page 30-35  XML PDF (1.34 MB)
Document Type: Research and Reference
DOI: 10.21608/djs.2019.139192
View on SCiNiTO View on SCiNiTO
Authors
E. M. El-Kholy1; H. Ahmed2
1Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt.
2Department of Mathematics, Faculty of Shoubra Engineering , BanhaUniversity ,Egypt.
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.
Keywords
Clique number; chromatic number; perfect graphs; graph folding
Statistics
Article View: 94
PDF Download: 504