Basic Theory of Hierarchical SuperHyperGraphs: Cross-LevelIncidence, Direction, and Bidirection

Autores/as

  • Fujita Takaaki Independent Researcher, Tokyo, Japan Autor/a
  • Ajoy Kanti Das Associate Professor, Department of Mathematics, Tripura University, Agartala Autor/a
  • Suman Das Assistant Professor Grade II (Mathematics), Department of Education, National Institute of Technology Calicut, Kozhikode-673601, Kerala, India. Autor/a
  • Sankar l Prasad Monda Department of Applied Mathematics, Maulana Abul Kalam Azad University of Technology, West Bengal, Haringhata-741249, West Bengal, India. Autor/a

Palabras clave:

SuperHyperGraph, Hierarchical Superhypergraphs, Hierarchical Directed SuperHyperGraphs, Hierarchical Bidirected SuperHyperGraphs

Resumen

Hypergraphs extend ordinary graphs by permitting a single hyperedge to connect any nonempty
set of vertices, thereby representing intrinsically multiway interactions. To capture hierarchical or multi-layer
organization, SuperHyperGraphs further iterate the powerset construction, so that aggregates formed at one
level can themselves act as vertices or edge endpoints at higher levels. While this modeling perspective is
increasingly relevant, a systematic treatment of hierarchical SuperHyperGraphs remains at an early stage and
many foundational notions are not yet widely standardized. Addressing this gap, we introduce and investigate
three hierarchical extensions: Hierarchical SuperHyperGraphs, Hierarchical Directed SuperHyperGraphs, and
Hierarchical Bidirected SuperHyperGraphs.

a

Descargas

Publicado

2026-07-29

Número

Sección

Artículos

Cómo citar

Basic Theory of Hierarchical SuperHyperGraphs: Cross-LevelIncidence, Direction, and Bidirection. (2026). Neutrosophic Computing and Machine Learning, 44, 523-550. https://fs.unm.edu/NCML_2/index.php/NCML/article/view/144

Artículos más leídos del mismo autor/a

Artículos similares

También puede Iniciar una búsqueda de similitud avanzada para este artículo.