Results 31 to 40 of about 11,127 (100)
Annotated hypergraphs: models and applications
Hypergraphs offer a natural modeling language for studying polyadic interactions between sets of entities. Many polyadic interactions are asymmetric, with nodes playing distinctive roles.
Philip Chodrow, Andrew Mellor
doaj +1 more source
A lifting of graphs to 3-uniform hypergraphs, its generalization, and further investigation of hypergraph Ramsey numbers [PDF]
Ramsey theory has posed many interesting questions for graph theorists that have yet to besolved. Many different methods have been used to find Ramsey numbers, though very feware actually known.
NC DOCKS at Western Carolina University +1 more
core
Enumeration of hypergraphs [PDF]
Formulae for the generating functions for hypergraphs, dihypergraphs, oriented hypergraphs, selfcomplementary directed hypergraphs and self complementary hypergraphs are presented ...
Hegde, M, Sridharan, MR
core
Chain and threshold hypergraphs
Threshold graphs and chain graphs are the graphs with maximum spectral radius among the family of all connected graphs and connected bipartite graphs, respectively.
Shashwath S. Shetty, Arathi Bhat K
doaj +1 more source
Hypergraph partitioning using tensor eigenvalue decomposition.
Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities.
Deepak Maurya, Balaraman Ravindran
doaj +1 more source
On Laplacian Energy of r-Uniform Hypergraphs
The matrix representations of hypergraphs have been defined via hypermatrices initially. In recent studies, the Laplacian matrix of hypergraphs, a generalization of the Laplacian matrix, has been introduced.
N. Feyza Yalçın
core +1 more source
Complement Reducible Uniform Hypergraphs
We investigate a generalization of complement reducible graphs, called co-graphs, for r-uniform hypergraphs. The operations of r-co-hypergraphs are the disjoint union of two given r-co-hypergraphs and the join operation, which inserts all hyperedges of ...
Frank Gurski, Jochen Rethmann
doaj +1 more source
Saliency Detection Method Using Hypergraphs on Adaptive Multiscales
Saliency detection plays an important role in the fields of image processing and computer vision. We present an improved saliency detection method by means of hypergraphs on adaptive multi-scales (HAM).
Feilin Han, Aili Han, Jing Hao
doaj +1 more source
Niche Hypergraphs of Products of Digraphs
If D = (V, A) is a digraph, its niche hypergraph Nℋ(D) = (V, ℰ) has the edge set ℰ={e⊆V||e|≥2∧∃ υ∈V:e=ND−(υ)∨e=ND+(υ)}{\cal E} = \{ {e \subseteq V| | e | \ge 2 \wedge \exists \, \upsilon \in V:e = N_D^ - ( \upsilon ) \vee e = N_D^ + ( \upsilon ...
Sonntag Martin, Teichert Hanns-Martin
doaj +1 more source
Coloring directed hypergraphs [PDF]
Inspired by earlier results about proper and polychromatic coloring of hypergraphs, we investigate such colorings of directed hypergraphs, that is, hypergraphs in which the vertices of each hyperedge is partitioned into two parts, a tail and a head.
Keszegh, Balázs, Balázs Keszegh
core +1 more source

