Results 31 to 40 of about 87 (83)
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
, 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
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
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
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
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
Almost Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2017 It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and ...
Kamble Lata N. +2 more
doaj +1 more source
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
Forum of Mathematics, Sigma, 2017 A celebrated result of Rödl and Ruciński states that for every graph $F$ , which is not a forest of stars and paths of length 3, and fixed number of colours
LUCA GUGELMANN +5 more
doaj +1 more source
A minimum dimensional class of simple games
Simple games, Hypergraphs, Boolean algebra, Dimension, Codimension, 05C65, 91A12, 94C10,
Josep Freixas, Dorota Marciniak
core +1 more source