Some Graph Parameters for Superhypertree-width and Neutrosophictree-width

Takaaki Fujita, Independent Researcher, Shinjuku, Shinjuku-ku, Tokyo, JapanFollow
Florentin Smarandache, Department of Mathematics & Sciences, University of New Mexico, Gallup, NM 87301, USAFollow

ORCID

Takaaki Fujita: https://orcid.org/0009-0007-1509-2728

Florentin Smarandache: https://orcid.org/0000-0002-5560-5926

Article Type

Article

Abstract

Graph characteristics are often studied through various parameters, with ongoing research dedicated to exploring these aspects. Among these, graph width parameters—such as treewidth—are particularly important due to their practical applications in algorithms and real-world problems. A hypergraph generalizes traditional graph theory by abstracting and extending its concepts [77]. More recently, the concept of a SuperHyperGraph has been introduced as a further generalization of the hypergraph. Neutrosophic logic [133], a mathematical framework, extends classical and fuzzy logic by allowing the simultaneous consideration of truth, indeterminacy, and falsity within an interval. In this paper, we explore Superhypertree-width, Neutrosophic treewidth, and t-Neutrosophic tree-width.

Keywords

Neutrosophic graph, Hypertree width, Superhypertree width, Tree-width, Neutrosophictree-width

How to Cite

Fujita, Takaaki and Smarandache, Florentin (2025) "Some Graph Parameters for Superhypertree-width and Neutrosophictree-width," Neutrosophic Systems with Applications: Vol. 25: Iss. 1, Article 5. DOI: https://doi.org/10.61356/j.nswa.2025.25453