Characteristics of Soft Semitrees: Enhancing the Soft Semigraph Framework
Molodtsov pioneered the concept of soft sets, offering a method to classify elements of a universe based on a specified set of parameters. This approach serves to model vagueness and uncertainty. Semigraphs are a generalised form of graphs introduced by Sampathkumar et al. (Semigraphs and Their Applications, Academy of Discrete Mathematics and Applications, Mysore, India, 337 pages (2019)). Integrating soft set theory into semigraphs led to the creation of soft semigraphs. Due to its adeptness in handling parameterisation, the field of soft semigraph theory is rapidly evolving. In this study, we introduce the concept of soft semitrees and explore some of their characteristics.
Authors
- Jinta Jose (ORCID: https://orcid.org/0000-0002-3743-2945)
- Rajesh K. Thumbakara (ORCID: https://orcid.org/0000-0001-7503-8861)
- Bobin George (ORCID: https://orcid.org/0000-0002-2477-6220)
- Sijo P. George (ORCID: https://orcid.org/0000-0003-1242-8066)
Institutions
- Mahatma Gandhi University (IN)
- APJ Abdul Kalam Technological University (IN)
Publication Details
- Journal
- Communications in Mathematics and Applications
- Published
- 2024-11-30
- DOI
- https://doi.org/10.26713/cma.v15i3.2828
- Primary Topic
- Educational Technology and Assessment
- Type
- article
- Field-Weighted Citation Impact
- 0.00