Results 1 to 10 of about 42 (42)

Neighborhood hypergraph model for topological data analysis

open access: yesComputational and Mathematical Biophysics, 2022
Hypergraph, as a generalization of the notions of graph and simplicial complex, has gained a lot of attention in many fields. It is a relatively new mathematical model to describe the high-dimensional structure and geometric shapes of data sets.
Liu Jian, Chen Dong, Li Jingyan, Wu Jie
doaj   +1 more source

Corrigendum to: Bounds on the Number of Edges of Edge-Minimal, Edge-Maximal and l-Hypertrees [Discussiones Mathematicae Graph Theory 36 (2016) 259–278]

open access: yesDiscussiones Mathematicae Graph Theory, 2022
In this corrigendum, we correct the proof of Theorem 10 from our paper titled „Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees”.
Szabó Péter G.N.
doaj   +1 more source

Covering the Edges of a Random Hypergraph by Cliques

open access: yesDiscussiones Mathematicae Graph Theory, 2022
We determine the order of magnitude of the minimum clique cover of the edges of a binomial, r-uniform, random hypergraph G(r)(n, p), p fixed. In doing so, we combine the ideas from the proofs of the graph case (r = 2) in Frieze and Reed [Covering the ...
Rödl Vojtěch, Ruciński Andrzej
doaj   +1 more source

The (1, 2)-step competition graph of a hypertournament

open access: yesOpen Mathematics, 2021
In 2011, Factor and Merz [Discrete Appl. Math. 159 (2011), 100–103] defined the (1,2)\left(1,2)-step competition graph of a digraph. Given a digraph D=(V,A)D=\left(V,A), the (1,2)\left(1,2)-step competition graph of D, denoted C1,2(D){C}_{1,2}\left(D ...
Li Ruijuan, An Xiaoting, Zhang Xinhong
doaj   +1 more source

The signless Laplacian matrix of hypergraphs

open access: yesSpecial Matrices, 2022
In this article, we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix to structural parameters of the hypergraph ...
Cardoso Kauê, Trevisan Vilmar
doaj   +1 more source

Compression with wildcards: All exact or all minimal hitting sets

open access: yesOpen Mathematics, 2023
Our objective is the compressed enumeration (based on wildcards) of all minimal hitting sets of general hypergraphs. To the author’s best knowledge, the only previous attempt towards compression, due to Toda, is based on binary decision diagrams and much
Wild Marcel
doaj   +1 more source

Rainbow spanning structures in graph and hypergraph systems

open access: yesForum of Mathematics, Sigma, 2023
We study the following rainbow version of subgraph containment problems in a family of (hyper)graphs, which generalizes the classical subgraph containment problems in a single host graph. For a collection $\mathit {\mathbf {G}}=\{G_1, G_2,\ldots , G_{
Yangyang Cheng   +3 more
doaj   +1 more source

Recursion Relations for Chromatic Coefficients for Graphs and Hypergraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2022
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney’s broken cycle theorem for hypergraphs, as well as deriving an explicit ...
Durhuus Bergfinnur, Lucia Angelo
doaj   +1 more source

On the distance energy of k-uniform hypergraphs

open access: yesSpecial Matrices, 2023
In this article, we extend the concept of distance energy for hypergraphs. We first establish a relation between the distance energy and the distance spectral radius.
Sharma Kshitij, Panda Swarup Kumar
doaj   +1 more source

Sum-List Colouring of Unions of a Hypercycle and a Path with at Most Two Vertices in Common

open access: yesDiscussiones Mathematicae Graph Theory, 2020
Given a hypergraph 𝒣 and a function f : V (𝒣) → 𝕅, we say that 𝒣 is f-choosable if there is a proper vertex colouring ϕ of 𝒣 such that ϕ (v) ∈ L(v) for all v ∈ V (𝒣), where L : V (𝒣) → 2𝕅 is any assignment of f(v) colours to a vertex v.
Drgas-Burchardt Ewa   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy