Article Fingerprint
ReserarchID
Z790M
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.
e._m._el-kholy. 2021. \u201cPerfect Folding of Graphs\u201d. Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 21 (GJSFR Volume 21 Issue F1).
Crossref Journal DOI 10.17406/GJSFR
Print ISSN 0975-5896
e-ISSN 2249-4626
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 102
Country: Unknown
Subject: Global Journal of Science Frontier Research - F: Mathematics & Decision
Authors: E. M. El-Kholy, H. Ahmed (PhD/Dr. count: 0)
View Count (all-time): 184
Total Views (Real + Logic): 2288
Total Downloads (simulated): 1073
Publish Date: 2021 02, Fri
Monthly Totals (Real + Logic):
This study aims to comprehensively analyse the complex interplay between
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.