Short note of supertree-width and n-Superhypertree-width

Authors

  • Takaaki Fujita Independece Researcher; Shinjuku, Shinjuku-ku, Tokyo, Japan

Keywords:

hypergraph, supergraph, superhypergraph, treewidth, hypertree-width

Abstract

This paper investigates the properties of tree-width and related graph width parameters for n
SuperHyperGraphs, a broader generalization of hypergraphs. By exploring concepts such as SuperHyperTree
width and Hypertree-width, we aim to understand how these structures resemble tree-like formations. We
 also analyze the relevance of these width parameters in computational contexts, following extensive research in
 graph theory and hypergraph applications.

 

DOI: 10.5281/zenodo.14062290

Downloads

Download data is not yet available.

Downloads

Published

2024-11-10

Issue

Vol. 77 (2025): Neutrosophic Sets and Systems

Section

Article

License

Copyright (c) 2024 Neutrosophic Sets and Systems

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

 Creative Commons Attribution (CC BY) license.

How to Cite

Takaaki Fujita. (2024). Short note of supertree-width and n-Superhypertree-width. Neutrosophic Sets and Systems, 77, 54-78. https://fs.unm.edu/nss8/index.php/111/article/view/5243