Abstract

A graph in which the edge can connect more than two vertices is called a Hypergraph. A ''k''-partite hypergraph is a hypergraph whose vertices can be split into ''k'' different independent sets. In this paper, regular, totally regular, totally irregular, totally neighborly irregular Intuitionistic Fuzzy ''k''-Partite Hypergraphs (IF''k''-PHGs) are defined. Also order and size along with the properties of regular and totally regular IF''k''-PHGs are discussed. It has been proved that the size <math>S(\mathscr{H})</math> of a ''r''-regular IF''k''-PHG is <math>\frac{tr}{2}</math> where <math>t=\left|V\right|</math>. The dual IF''k''-PHG has also been defined with example.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.