Results 121 to 130 of about 698,372 (216)

Spectral directed hypergraph theory via tensors

, 2016
In this paper, we show that each of the adjacency tensor, the Laplacian tensor and the signless Laplacian tensor of a uniform directed hypergraph has n linearly independent H-eigenvectors.
Xie, J, Qi, LQ
core   +1 more source

Finding Set Extreme 3-Uniform Hypergraphs Cardinality through Second-Order Signatures

Axioms
This paper continues the study of second-order signature properties—the characterization of the extreme 3-uniform hypergraph. Previously, bases were used to count extreme 3-uniform hypergraphs.
Evgeniya Egorova, Vladislav Leonov, Aleksey Mokryakov, Vladimir Tsurkov   +3 more
doaj   +1 more source

ROTC uniform, gta1056

, 2022
The U.S. Congress passed the National Defense Act in June 1916 which provided for the formation of the Reserve Officers' Training Corps (ROTC). The first unit formed at Georgia Tech in March 1918.

core  

HYPERGRAPH DAN BLOCK DESIGN

Suatu hypergraph didefinisikan sebagai pasangan himpunan ( , ) di mana = * 1, 2, … , + adalah himpunan berhingga dari n vertices dan = * | ⊆ V, = 1,2, … , + adalah himpunan hyperedge.
SAPUTRA, GILANG ANDI JAYA, Baki, Swita, Mudin, Simanihuruk   +2 more
core   +2 more sources

Maximum Packing of λ-Fold Complete 3-Uniform Hypergraph with a Special Tetrahedron

Let Kv(3)=(V,E) be the complete 3-uniform hypergraph, where the vertex set is V={x1,x2,⋯,xv}, in which the edge set E is of all triples. Let ST denote the special tetrahedron with four edges, where each edge contains three vertices of degree 2.
Yuzhe Zhu, Hongtao Zhao
core   +1 more source

Recognizing the P 4-structure of claw-free graphs and a larger graph class

Discrete Mathematics & Theoretical Computer Science, 2002
The P 4-structure of a graph G is a hypergraph H on the same vertex set such that four vertices form a hyperedge in H whenever they induce a P 4 in G.
Luitpold Babel, Andreas Brandstädt, Van Bang Le   +2 more
doaj  

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, Salia, Nika, Cambie, Stijn, Gyori, Ervin, Tompkins, Casey   +4 more
core   +1 more source

Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques

, 2017
In a series of recent works, we have generalised the consistency results in the stochastic block model literature to the case of uniform and non-uniform hypergraphs.
Dukkipati, Ambedkar, Ghosdastidar, Debarghya   +1 more
core  

Higher-order trade-offs in hypergraph community detection. [PDF]

Sci Adv
Li J, Schaub MT, Peel L.
europepmc   +1 more source

Loose Hamilton paths in the 3-uniform cube hypergraph

It is well-known that the $d$-dimensional hypercube contains a Hamilton cycle for $d\ge 2$. In this paper we address the analogous problem in the $3$-uniform cube hypergraph, a $3$-uniform analogue of the hypercube: for simple parity reasons, the $3 ...
Machata, Johannes, Pasch, Matija, Cooley, Oliver   +2 more
core