On Trimming Simple Hypergraphs

1
R. Dharmarajan
R. Dharmarajan
2
Dr. R. Dharmarajan
Dr. R. Dharmarajan
3
D. Ramachandran
D. Ramachandran
1 SASTRA University

Send Message

To: Author

GJSFR Volume 12 Issue F9

Article Fingerprint

ReserarchID

764Y7

On Trimming Simple Hypergraphs Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

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.

4 Cites in Articles

References

  1. R Stoll (1963). Set Theory and logic.
  2. C Berge (1989). Hyergraphs -Combinatorics on finite sets.
  3. Thomas Eiter,Georg Gottlob (1995). Identifying the Minimal Transversals of a Hypergraph and Related Problems.
  4. K Rosen (2000). Handbook of Discrete and Combinatorial Mathematics.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

R. Dharmarajan. 2012. \u201cOn Trimming Simple Hypergraphs\u201d. Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 12 (GJSFR Volume 12 Issue F9): .

Download Citation

Issue Cover
GJSFR Volume 12 Issue F9
Pg. 21- 26
Journal Specifications

Crossref Journal DOI 10.17406/GJSFR

Print ISSN 0975-5896

e-ISSN 2249-4626

Classification
Not Found
Version of record

v1.2

Issue date

August 7, 2012

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 5079
Total Downloads: 2621
2026 Trends
Research Identity (RIN)
Related Research

Published Article

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.

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]
×

This Page is Under Development

We are currently updating this article page for a better experience.

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