Results 31 to 40 of about 118 (93)
Revisiting hypergraph models for sparse matrix partitioning [PDF]
, 2006 . We provide an exposition of hypergraph models for parallelizing sparse matrix-vector multiplies. Our aim is to emphasize the expressive power of hypergraph models.
Uçar, Bora +4 more
core +1 more source
Asymptotic Sharpness of Bounds on Hypertrees
Discussiones Mathematicae Graph Theory, 2017 The hypertree can be defined in many different ways. Katona and Szabó introduced a new, natural definition of hypertrees in uniform hypergraphs and investigated bounds on the number of edges of the hypertrees.
Lin Yi, Kang Liying, Shan Erfang
doaj +1 more source
On cordial labeling of hypertrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Let $f:V\rightarrow\mathbb{Z}_k$ be a vertex labeling of a hypergraph $H=(V,E)$. This labeling induces an~edge labeling of $H$ defined by $f(e)=\sum_{v\in e}f(v)$, where the sum is taken modulo $k$.
Michał Tuczyński +2 more
doaj +1 more source
Малки неравномерни хиперграфи без свойство B
, 2023 [Cherkashin Danila; Черкашин Данила]2020 Mathematics Subject Classification: 05C15 ...
Cherkashin, Danila
core
On characterization of finite modules by hypergraphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 With a finite R-module M we associate a hypergraph 𝒞𝒥ℋR(M) having the set V of vertices being the set of all nontrivial submodules of M. Moreover, a subset Ei of V with at least two elements is a hyperedge if for K, L in Ei there is K ∩ L ≠ = 0 and Ei is
Hamzekolaee Ali Reza Moniri +1 more
doaj +1 more source
, 2017 A set S of vertices in a graph G is a packing if the vertices in S are pairwise at distance at least 3 apart in G. The packing number of G, denoted by p(G), is the maximum cardinality of a packing in G. Favaron [Discrete Math. 158 (1996), 287–293] showed
Michael A. Henning +3 more
core +1 more source
Algebraic Heun Operators with Tetrahedral Monodromy
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 Our work adds to the picture of second order differential operators with a full set of algebraic solutions, which we will call algebraic. We see algebraic Heun operators as pull-backs of algebraic hypergeometric operators via Belyi functions. We focus on
Pleşca Iulia-Cătălina
doaj +1 more source
Matchings in multipartite hypergraphs [PDF]
A folklore result on matchings in graphs states that if \(G\) is a bipartite graph whose vertex classes \(A\) and \(B\) each have size \(n\), with \(\deg(u) \geq a\) for every \(u \in A\) and \(\deg(v) \geq b\) for every \(v \in B\), then \(G\) admits a ...
Bowtell, Candida, Mycroft, Richard
core +1 more source
Integral geometry on discrete matrices
Moroccan Journal of Pure and Applied Analysis, 2021 In this note, we study the Radon transform and its dual on the discrete matrices by defining hyperplanes as being infinite sets of solutions of linear Diophantine equations. We then give an inversion formula and a support theorem.
Attioui Abdelbaki
doaj +1 more source
Eigenvalues of the Adjacency Tensor on Products of Hypergraphs [PDF]
, 2013 We consider the generalized notions of Cartesian and tensor products on m-uniform hypergraphs. The adjacency tensor is analogous to the adjacency matrix and two different notions of eigenvalues of the adjacency tensor on the products of hypergraphs are ...
Kelly J Pearson, Tan Zhang
core