Analytic methods for uniform hypergraphs

From MaRDI portal
Revision as of 08:24, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2250784

DOI10.1016/j.laa.2014.05.005zbMath1291.05142arXiv1308.1654OpenAlexW2964193560MaRDI QIDQ2250784

Vladimir Nikiforov

Publication date: 21 July 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.1654



Related Items

The \(H\)-spectra of a class of generalized power hypergraphs, Some properties of the p-spectral radius on tensors for general hypergraphs and their applications, Combinatorial methods for the spectral \(p\)-norm of hypermatrices, Unnamed Item, Unnamed Item, Principal eigenvectors and spectral radii of uniform hypergraphs, Connected hypergraphs with small spectral radius, On the principal eigenvectors of uniform hypergraphs, The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs, Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs, The spectrum of a class of uniform hypergraphs, Extremal problems for the \(p\)-spectral radius of Berge hypergraphs, Spectral extremal graphs for the bowtie, Some extremal problems for hereditary properties of graphs, Extremal problems for the \(p\)-spectral radius of graphs, Refinement on Spectral Turán’s Theorem, Some bounds on the spectral radius of uniform hypergraphs, Minimizing the distance spectral radius of uniform hypertrees with given parameters, Some properties and applications of odd-colorable \(r\)-hypergraphs, The eigenvectors to the \(p\)-spectral radius of general hypergraphs, The high order spectrum of a graph and its applications in graph colouring and clique counting, Comparing the principal eigenvector of a hypergraph and its shadows, On spectral theory of a k-uniform directed hypergraph, On the spectral radii and principal eigenvectors of uniform hypergraphs, On extremal spectral radius of blow-up uniform hypergraphs, Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs, The maximum spectral radius ofk-uniform hypergraphs withrpendent vertices, The extremal \(p\)-spectral radius of Berge hypergraphs, The \(\alpha\)-normal labeling for generalized directed uniform hypergraphs, The principal eigenvector to \(\alpha\)-spectral radius of hypergraphs, Bounds on the spectral radius of uniform hypergraphs, The stabilizing index and cyclic index of the coalescence and Cartesian product of uniform hypergraphs, The p-spectral radius of the Laplacian matrix, On the first and second eigenvalue of finite and infinite uniform hypergraphs, Computing the \(p\)-spectral radii of uniform hypergraphs with applications, Hypergraphs and hypermatrices with symmetric spectrum, The matching polynomials and spectral radii of uniform supertrees, On the irregularity of uniform hypergraphs, Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees, On the irregularity of uniform hypergraphs, The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number, Adjacency spectra of random and complete hypergraphs, The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs, The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs



Cites Work