GET THE APP

..

Journal of Applied & Computational Mathematics

ISSN: 2168-9679

Open Access

Perfect Folding of Graphs

Abstract

El Kholy*

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 C. 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.

PDF

Share this article

Google scholar citation report
Citations: 364

Journal of Applied & Computational Mathematics received 364 citations as per google scholar report

Journal of Applied & Computational Mathematics peer review process verified at publons

Indexed In

 
arrow_upward arrow_upward