Results 21 to 30 of about 11,127 (100)

Cartesian product of hypergraphs: properties and algorithms [PDF]

Electronic Proceedings in Theoretical Computer Science, 2009
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product.
Alain Bretto, Yannick Silvestre, Thierry Vallée   +2 more
doaj   +1 more source

Effective epidemic containment strategy in hypergraphs

Physical Review Research, 2021
Recently, hypergraphs have attracted considerable interest from the research community as a generalization of networks capable of encoding higher-order interactions, which commonly appear in both natural and social systems.
Bukyoung Jhun
doaj   +1 more source

Directed n-Superhypergraphs Incorporating Bipolar Fuzzy Information: A Multi-Tier Framework for Modeling Bipolar Uncertainty in Complex Networks [PDF]

Neutrosophic Sets and Systems
Graph theory studies the mathematical structures of vertices and edges to model relationships and connectivity. Hypergraphs extend this framework by allowing hyperedges to connect arbitrarily many vertices at once [1], and Super-HyperGraphs further ...
Florentin Smarandache, Takaaki Fujita
doaj   +1 more source

A Note on Packing of Uniform Hypergraphs

Discussiones Mathematicae Graph Theory, 2022
We say that two n-vertex hypergraphs H1 and H2 pack if they can be found as edge-disjoint subhypergraphs of the complete hypergraph Kn. Whilst the problem of packing of graphs (i.e., 2-uniform hypergraphs) has been studied extensively since seventies ...
Konarski Jerzy, Woźniak Mariusz, Żak Andrzej   +2 more
doaj   +1 more source

A Theoretical Investigation Based on the Rough Approximations of Hypergraphs

Journal of Mathematics, 2022
Rough sets are a key tool to model uncertainty and vagueness using upper and lower approximations without predefined functions and additional suppositions.
Musavarah Sarwar
doaj   +1 more source

The Cut Method on Hypergraphs for the Wiener Index [PDF]

, 2023
The cut method has been proved to be extremely useful in chemical graph theory. In this paper the cut method is extended to hypergraphs. More precisely, the method is developed for the Wiener index of $k$-uniform partial cube-hypergraphs.
Klavžar, Sandi, Romih, Gašper Domen
core   +2 more sources

Adjacency spectra of some subdivision hypergraphs [PDF]

, 2023
Here, we define a subdivision operation for a hypergraph and compute all the eigenvalues of the subdivision of regular and certain non-regular hypergraphs.
Das, Arpita, Banerjee, Anirban
core   +1 more source

Granulation of Hypernetwork Models under the q-Rung Picture Fuzzy Environment

Mathematics, 2019
In this paper, we define q-rung picture fuzzy hypergraphs and illustrate the formation of granular structures using q-rung picture fuzzy hypergraphs and level hypergraphs.
Anam Luqman, Muhammad Akram, Ali N. A. Koam   +2 more
doaj   +1 more source

Chromatic polynomials of hypergraphs and mixed hypergraphs

, 2020
This thesis covers two main topics: chromatic polynomials of hypergraphs and mixed ...
Zhang, Ruixue
core   +1 more source

Niche Hypergraphs

Discussiones Mathematicae Graph Theory, 2016
If D = (V,A) is a digraph, its niche hypergraph NH(D) = (V, E) has the edge set ℇ = {e ⊆ V | |e| ≥ 2 ∧ ∃ v ∈ V : e = N−D(v) ∨ e = N+D(v)}. Niche hypergraphs generalize the well-known niche graphs (see [11]) and are closely related to competition ...
Garske Christian, Sonntag Martin, Teichert Hanns-Martin   +2 more
doaj   +1 more source