Graph theory examines the structure of networks by treating entities as vertices and the connections between them as edges. A Hyper-Graph enhances this framework by permitting a single Hyper-edge to link multiple vertices at once. Building on that idea, a Super-Hyper-Graph introd...
Open access
Research Article10.9734/air/2025/v26i41412
Many biomedical systems exhibit interactions that go beyond simple pairwise connections. A hypergraph generalizes a graph by permitting an edge to connect any number of vertices—such edges are called hyperedges. A superhypergraph further extends this concept by recursively nestin...
Open access
Research Article10.9734/air/2025/v26i31368
Graph theory is a core branch of mathematics concerned with representing and analyzing relationships among discrete elements. These concepts are widely used in fields such as electrical engineering. For example, graphs play a crucial role in important frameworks including Graph S...
Open access
Research Article10.9734/jerr/2025/v27i51522
Graph theory provides a foundation for modeling relationships among discrete elements via vertices and edges (Diestel, 2000, 2005). HyperGraphs extend this framework by allowing edges—hyperedges—to join more than two vertices, while superhypergraphs introduce nested powerset laye...
Open access
Research Article10.9734/ajarr/2025/v19i51023
Graphs are fundamental tools for modeling pairwise relationships in complex systems. However, many realworld infrastructures—such as energy systems—demand more expressive frameworks to represent multinode and hierarchical interactions. A hypergraph generalizes classical graphs by...
Open access
Research Article10.9734/jenrr/2025/v17i6425
A molecular graph is a labeled graph in which atoms are represented by vertices and covalent bonds by edges, with each edge labeled according to the bond type (Gasteiger et al., 2020). A hypergraph generalizes the concept of a traditional graph by allowing edges—called hyperedges...
Open access
Research Article10.9734/ajopacs/2025/v13i3248
Linear-width is a widely recognized and highly valued graph width parameter. The concepts of linear tangle and linear obstacle are dual concepts of linear-width. In this concise paper, we present an alternative proof of the equivalence between linear tangle and linear obstacle.
Open access
Research Article10.9734/arjom/2023/v19i8687