Neural Networks and Rules-based Systems used to Find Rational and Scientific Correlations between being Here and Now with Afterlife Conditions
Neural Networks and Rules-based Systems used to Find Rational and
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
The methods for personal identification and authentication are no exception.
The methods for personal identification and authentication are no exception.
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): 147
Total Views (Real + Logic): 2222
Total Downloads (simulated): 1046
Publish Date: 2021 02, Fri
Monthly Totals (Real + Logic):
Neural Networks and Rules-based Systems used to Find Rational and
A Comparative Study of the Effeect of Promotion on Employee
The Problem Managing Bicycling Mobility in Latin American Cities: Ciclovias
Impact of Capillarity-Induced Rising Damp on the Energy Performance of
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.
We are currently updating this article page for a better experience.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.