Perfect Folding of Graphs

Authors

  • E. M. El-Kholy

  • H. Ahmed

clique number, chromatic number, perfect graphs, graph folding

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.

References

B. Bollobas (2000) West, D B "A note on generalized chromatic number and generalized girth" Disc. 213(1-3), 29-34. https://doi.org/10.1016/s0012-365x(99)00165-x

R. Balakrishnan, K. Ranganathan (1991) A text book of graph theory.

P. Erdos (1959) "Graph theory and probability" Canad J. 11, 34-38. https://doi.org/10.4153/cjm-1959-003-9

E. El-Kholy (2005) Al-Esawy, A "Graph folding of some special graphs" J Math. 1(1), 66-70.

E. EL-Kholy, N. EL-Sharkawe (2014) EL-Sharkawe, N.: The chromatic number and graph folding" European J. 120(1), 138-144.

M. Golumbic (2004) Algorithmic graph theory and perfect graphs. 7.

L. Lovasz (1984) Normal Hypergraphs and the Weak Perfect Graph Conjecture. 21, 29-42. https://doi.org/10.1016/s0304-0208(08)72920-7

W. Lowell, J. Robin (1983) Selected topics in graph theory2.

Perfect Folding of Graphs

Published

2021-01-25

How to Cite

Perfect Folding of Graphs. (2021). Global Journal of Science Frontier Research, 21(2), 7-15. https://www.journalofscience.org/index.php/GJSFR/article/view/2887