On Trimming Simple Hypergraphs

Article ID

764Y7

On Trimming Simple Hypergraphs

Dr. R. Dharmarajan
Dr. R. Dharmarajan
D. Ramachandran
D. Ramachandran
DOI

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.

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.

Dr. R. Dharmarajan
Dr. R. Dharmarajan
D. Ramachandran
D. Ramachandran

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): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/GJSFR

Print ISSN 0975-5896

e-ISSN 2249-4626

Issue Cover
GJSFR Volume 12 Issue F9
Pg. 21- 26
Classification
Not Found
Article Matrices
Total Views: 5024
Total Downloads: 2520
2026 Trends
Research Identity (RIN)
Related Research
Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

On Trimming Simple Hypergraphs

Dr. R. Dharmarajan
Dr. R. Dharmarajan
D. Ramachandran
D. Ramachandran

Research Journals