Results 41 to 50 of about 11,526 (190)
On the α-Spectral Radius of Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2020 For 0 ≤ α ---lt--- 1 and a uniform hypergraph G, the α-spectral radius of G is the largest H-eigenvalue of αD(G)+(1−α)A(G), where D(G) and A(G) are the diagonal tensor of degrees and the adjacency tensor of G, respectively. We give upper bounds for the α-
Guo Haiyan, Zhou Bo
doaj +1 more source
Coloring $$d$$ d -Embeddable $$k$$ k -Uniform Hypergraphs [PDF]
Discrete & Computational Geometry, 2013 18 ...
Carl Georg Heise +3 more
openaire +4 more sources
Sierpiński products of r-uniform hypergraphs
The Art of Discrete and Applied Mathematics, 2022 Summary: If \(H_1\) and \(H_2\) are \(r \)-uniform hypergraphs and \(f\) is a function from the set of all \((r - 1)\)-element subsets of \(V(H_1)\) into \(V(H_2)\), then the Sierpiński product \(H_1 \otimes_f H_2\) is defined to have vertex set \(V(H_1) \times V(H_2)\) and hyperedges falling into two classes: \[ (g, h_1) (g, h_2) \cdots (g, h_r ...
Budden, Mark, Hiller, Josh
openaire +2 more sources
On the spectrum of hypergraphs
, 2016 Here we study the spectral properties of an underlying weighted graph of a non-uniform hypergraph by introducing different connectivity matrices, such as adjacency, Laplacian and normalized Laplacian matrices. We show that different structural properties
Chris Ritchie (1952305) +4 more
core +3 more sources
Clique-symmetric uniform hypergraphs
Matemática Contemporânea, 2003 Summary: Let \(H\) be an \(r\)-uniform hypergraph of order \(p\), and \(\{H_{p1}, H_{p2},\dots\}\) be a countable sequence of \(r\)-uniform hypergrapbs with \(H_{pn}\) having \(pn\) vertices. The sequence is \(H\)-removable if \(H_{p1}\cong H\) and \(H_{pn}- S\cong H_{p(n-1)}\) where \(S\) is any vertex subset of \(H_{pn}\) that induces a copy of \(H\).
McSorley, John P, Porter, Thomas
openaire +3 more sources
More Results on The Smallest One-Realization of A Given Set II
Discussiones Mathematicae Graph Theory, 2019 Let S be a finite set of positive integers. A mixed hypergraph ℋ is a onerealization of S if its feasible set is S and each entry of its chromatic spectrum is either 0 or 1.
Diao Kefeng, Lu Fuliang, Zhao Ping
doaj +1 more source
Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles [PDF]
Opuscula Mathematica, 2019 We use the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph. A decomposition of complete \(k\)-uniform hypergraph \(K^{(k)}_{n}\) into Hamiltonian cycles was studied by Bailey-Stevens and Meszka-Rosa. For \(n\equiv 2,4,5\pmod 6\)
Meihua, Meiling Guan, Jirimutu
doaj +1 more source
Quantum Algorithms for Finding Constant-sized Sub-hypergraphs
, 2014 We develop a general framework to construct quantum algorithms that detect if a $3$-uniform hypergraph given as input contains a sub-hypergraph isomorphic to a prespecified constant-sized hypergraph.
A. Ambainis +8 more
core +1 more source
Hypergraphs with infinitely many extremal constructions
Discrete Analysis, 2023 Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a ...
Jianfeng Hou +4 more
doaj +1 more source
The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph [PDF]
, 2013 In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given.
Hu, Shenglong, Qi, Liqun, Xie, Jinshan
core