Please check our Instructions to Authors and send your manuscripts to nifs.journal@gmail.com.
Issue:Degrees and regularity of intuitionistic fuzzy semihypergraphs: Difference between revisions
Jump to navigation
Jump to search
Created page with "{{PAGENAME}} {{PAGENAME}} {{PAGENAME}} {{issue/title | title = Degrees and regularity of intuitionistic fuzzy semihypergraphs | shortcut = nifs/31/1/111-126 }} {{issue/author | author = K. K. Myithili | institution = Department of Mathematics (CA), Vellalar College for Women | address = Erode-..." |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 28: | Line 28: | ||
| format = PDF | | format = PDF | ||
| size = 375 | | size = 375 | ||
| abstract = This research work takes a new paradigm on the hypergraph concept which is a combination of a hypergraph and a semigraph. A semihypergraph is a connected hypergraph in which each hyperedge must have at least three vertices and any two hyperedges have at least one vertex in common. In a semihypergraph, vertices are classified as end, middle or middle-end vertices. This distinction, combined with membership and non-membership values, enables a more granular examination of vertices and their degrees in Intuitionistic Fuzzy Semihypergraphs (IFSHGs).<br/> This paper proposes four types of degrees: degree, end vertex degree, adjacent degree and consecutive adjacent degree on an IFSHG. Each degree reflects specific patterns within the intuitioistic fuzzy semihypergraphs. Additionally, three types of sizes are also defined: size, crisp size and pseudo size of IFSHGs. Concepts such as regular and totally regular IFSHGs with their properties are also defined | | abstract = This research work takes a new paradigm on the hypergraph concept which is a combination of a hypergraph and a semigraph. A semihypergraph is a connected hypergraph in which each hyperedge must have at least three vertices and any two hyperedges have at least one vertex in common. In a semihypergraph, vertices are classified as end, middle or middle-end vertices. This distinction, combined with membership and non-membership values, enables a more granular examination of vertices and their degrees in Intuitionistic Fuzzy Semihypergraphs (IFSHGs).<br/> This paper proposes four types of degrees: degree, end vertex degree, adjacent degree and consecutive adjacent degree on an IFSHG. Each degree reflects specific patterns within the intuitioistic fuzzy semihypergraphs. Additionally, three types of sizes are also defined: size, crisp size and pseudo size of IFSHGs. Concepts such as regular and totally regular IFSHGs with their properties are also defined. | ||
| keywords = Intuitionistic fuzzy semihypergraphs (IFSHGs), Degree, End vertex degree, Adjacent degree, Consecutive adjacent degree, Size, Regular, Totally regular. | | keywords = Intuitionistic fuzzy semihypergraphs (IFSHGs), Degree, End vertex degree, Adjacent degree, Consecutive adjacent degree, Size, Regular, Totally regular. | ||
| ams = 05C65, 05C72. | | ams = 05C65, 05C72. | ||
| references = | | references = | ||
# Archana, S., & Kuttipulackal, P. (2024). Analysis of various degrees and sizes in a fuzzy semigraph. IAENG International Journal of Applied Mathematics, 54(5), 975–983. | # Archana, S., & Kuttipulackal, P. (2024). Analysis of various degrees and sizes in a fuzzy semigraph. IAENG International Journal of Applied Mathematics, 54(5), 975–983. | ||
# Atanassov, K. T. (1999). Intuitionistic Fuzzy Sets: Theory and Applications. Physica-Verlag, Berlin. | # Atanassov, K. T. (1999). [[Intuitionistic Fuzzy Sets: Theory and Applications]]. Physica-Verlag, Berlin. | ||
# Berge, C. (1976). Graphs and Hypergraphs. North-Holland, New York. | # Berge, C. (1976). Graphs and Hypergraphs. North-Holland, New York. | ||
# Jagadeesan, S., Myithili, K. K., Thilagavathi, S., & Gayathri, L. (2024). A new paradigm on semihypergraph. Journal of Computational Analysis and Applications, 33(2), 514–522. | # Jagadeesan, S., Myithili, K. K., Thilagavathi, S., & Gayathri, L. (2024). A new paradigm on semihypergraph. Journal of Computational Analysis and Applications, 33(2), 514–522. | ||
Latest revision as of 11:31, 2 April 2025
shortcut
|
|