Results 121 to 130 of about 730,755 (216)
The maximum Wiener index of a uniform hypergraph
The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected $n$-vertex $k$-uniform hypergraph and characterize all hypergraphs attaining the ...
Tuite, James +4 more
core +1 more source
Linear trees in uniform hypergraphs
European Journal of Combinatorics, 2014 Given a tree T on v vertices and an integer k exceeding one. One can define the k-expansion T^k as a k-uniform linear hypergraph by enlarging each edge with a new, distinct set of (k-2) vertices. Then T^k has v+ (v-1)(k-2) vertices. The aim of this paper is to show that using the delta-system method one can easily determine asymptotically the size of ...
openaire +3 more sources
Wickets in 3-uniform hypergraphs
Discrete MathematicsIn these notes, we consider a Turán-type problem in hypergraphs. What is the maximum number of edges if we forbid a subgraph? Let $H_n^{(3)}$ be a 3-uniform linear hypergraph, i.e. any two edges have at most one vertex common. A special hypergraph, called {\em wicket}, is formed by three rows and two columns of a $3 \times 3$ point matrix.
openaire +3 more sources
On the Maximum Estrada Index of 3-Uniform Linear Hypertrees
The Scientific World Journal, 2014 For a simple hypergraph H on n vertices, its Estrada index is defined as EE(H)=∑i=1neλi, where λ1,λ2,…,λn are the eigenvalues of its adjacency matrix. In this paper, we determine the unique 3-uniform linear hypertree with the maximum Estrada index.
Faxu Li +4 more
doaj +1 more source
Complement Reducible Uniform Hypergraphs
AxiomsWe 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
Enumeration of unlabeled uniform hypergraphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The Hardness of 3-Uniform Hypergraph Coloring
, 2004 We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n 1/5) colors.
Oded Regev, Clifford Smyth, Irit Dinur
core
BLOCK DESIGN DENGAN PENDEKATAN DEGREE SEQUENCE k-UNIFORM HYPERGRAPH
Suatu hypergraph H didefinisikan sebagai pasangan himpunan ( , ), di mana = { 1, 2, … , } adalah himpunan berhingga dari vertex dan = { 1, 2, … , } merupakan himpunan hyperedge di mana , ∈ {1,2, … , } adalah subset dari ...
SIPAHUTAR, RIA LESTARI MUJIATI +2 more
core +1 more source
d-matching in k-uniform hypergraphs
, 2017 A matching of a [Formula: see text]-uniform hypergraph is a set of pairwise disjoint edges. A [Formula: see text]-matching in a [Formula: see text]-uniform hypergraph [Formula: see text] is a matching of size [Formula: see text]. Let [Formula: see text]
Yi Zhang, Mei Lu
core +1 more source
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence.
PLoS ONEPartite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each hyperedge contains exactly one point from each of the 3 disjoint vertex classes. We consider the degree sequence problem of partite, 3-uniform hypergraphs, that is, to decide if such ...
András Hubai +4 more
doaj +1 more source