Results 21 to 30 of about 11,124 (213)
, 2011 A support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a connected subgraph. We show how to test in polynomial time whether a given hypergraph has a cactus support, i.e. a support that is a tree of edges and cycles.
Brandes, Ulrik +3 more
openaire +4 more sources
ON THE SPECTRA OF TENSOR JOIN OF HYPERGRAPHS [PDF]
Journal of Algebraic SystemsIn this paper, we consider certain classes of hypergraphs constructed from the tensor join of hypergraphs, specifically the tensor join of hypergraphs constrained by vertex subsets and the $(H, \mathcal{T}_{\mathcal{S}})$-join of hypergraphs constrained ...
Vishnupriya Ramkumar, Rajkumar Rajendran
doaj +1 more source
Regular Single Valued Neutrosophic Hypergraphs [PDF]
Neutrosophic Sets and Systems, 2016 In this paper, we define the regular and totally regular single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular single valued neutrosophic hypergraphs.
Muhammad Aslam Malik +3 more
doaj +1 more source
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2023 Complexity science provides a powerful framework for understanding physical, biological and social systems, and network analysis is one of its principal tools. Since many complex systems exhibit multilateral interactions that change over time, in recent years, network scientists have become increasingly interested in modelling and ...
Corinna Coupette +2 more
openaire +5 more sources
Uniform hypergraphs containing no grids [PDF]
, 2013 A hypergraph is called an r×r grid if it is isomorphic to a pattern of r horizontal and r vertical lines, i.e.,a family of sets {A1, ..., Ar, B1, ..., Br} such that Ai∩Aj=Bi∩Bj=φ for 1 ...
Füredi, Zoltán, Ruszinkó, Miklós
core +1 more source
The Electronic Journal of Combinatorics, 2010 The notion of pattern hypergraph provides a unified view of several previously studied coloring concepts. A pattern hypergraph $H$ is a hypergraph where each edge is assigned a type $\Pi_i$ that determines which of possible colorings of the edge are proper. A vertex coloring of $H$ is proper if it is proper for every edge.
Zdenek Dvorák 0001 +3 more
openaire +2 more sources
Regular Bipolar Single Valued Neutrosophic Hypergraphs [PDF]
Neutrosophic Sets and Systems, 2016 In this paper, we define the regular and totally regular bipolar single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular bipolar single valued neutrosophic hypergraphs. We extend work on
Muhammad Aslam Malik +3 more
doaj +1 more source
Learnable Hypergraph Laplacian for Hypergraph Learning
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2022 HyperGraph Convolutional Neural Networks (HGCNNs) have demonstrated their potential in modeling high-order relations preserved in graph structured data. However, most existing convolution filters are localized and determined by the pre-defined initial hypergraph topology, neglecting to explore implicit and long-ange relations in real-world data.
Jiying Zhang +4 more
openaire +4 more sources
Journal of Computational Geometry, 2019 The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets.
Balázs Keszegh, Dömötör Pálvölgyi
doaj +1 more source
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source