On Trimming Simple Hypergraphs
We establish a necessary and sufficient condition for finding if the given hyperedge set in a simple hypergraph is a minimal hyperedge cover. Then we give a set theoretical proposition to find minimal hyperedge covers.
764Y7
Abstract
We establish a necessary and sufficient condition for finding if the given hyperedge set in a simple hypergraph is a minimal hyperedge cover. Then we give a set theoretical proposition to find minimal hyperedge covers.
We establish a necessary and sufficient condition for finding if the given hyperedge set in a simple hypergraph is a minimal hyperedge cover. Then we give a set theoretical proposition to find minimal hyperedge covers.
No Figures found in article.
R. Dharmarajan. 2012. “. Global Journal of Science Frontier Research – F: Mathematics & Decision GJSFR-F Volume 12 (GJSFR Volume 12 Issue F9): .
Crossref Journal DOI 10.17406/GJSFR
Print ISSN 0975-5896
e-ISSN 2249-4626
Total Score: 107
Country: India
Subject: Global Journal of Science Frontier Research - F: Mathematics & Decision
Authors: Dr. R. Dharmarajan, D. Ramachandran (PhD/Dr. count: 1)
View Count (all-time): 102
Total Views (Real + Logic): 5024
Total Downloads (simulated): 2520
Publish Date: 2012 08, Tue
Monthly Totals (Real + Logic):
Impact of Capillarity-Induced Rising Damp on the Energy Performance of
Liver Disease Prediction using Machine Learning Algorithms Home > GJCST
Digital Diasporas: Rethinking Belonging, Space, and Citizenship in the Digital
Healthcare Textiles: Innovations, Materials, Performance, Applications, and Future Prospects in
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.