The high order spectrum of a graph and its applications in graph colouring and clique counting
DOI10.1080/03081087.2022.2103490zbMATH Open1519.05154OpenAlexW4289173957MaRDI QIDQ6133767FDOQ6133767
Authors: Chunmeng Liu, Jiang Zhou, Changjiang Bu
Publication date: 21 August 2023
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2022.2103490
Recommendations
- Bounds on the spectral radius of general hypergraphs in terms of clique number
- Unified spectral bounds on the chromatic number
- Spectral bounds for the clique and independence numbers of graphs
- Spectral radii of graphs with given chromatic number
- Some upper bounds on the eigenvalues of uniform hypergraphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Multilinear algebra, tensor calculus (15A69) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Eigenvalues of a real supersymmetric tensor
- Large induced degenerate subgraphs
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Analytic methods for uniform hypergraphs
- Further results for Perron-Frobenius theorem for nonnegative tensors
- Spectra of uniform hypergraphs
- k-Degenerate Graphs
- Title not available (Why is that?)
- On determinants and eigenvalue theory of tensors
- Some spectral properties of uniform hypergraphs
- The Laplacian of a uniform hypergraph
- Cliques and the spectral radius
- Analogue of the identity Log Det = Trace Log for resultants
- The Eigenvalues of a Graph and Its Chromatic Number
- A Course in Enumeration
- The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
- Note on the colouring of graphs
- Decomposing a planar graph into degenerate graphs
- Some new trace formulas of tensors with applications in spectral hypergraph theory
- Title not available (Why is that?)
- The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
- The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning
- A Harary-Sachs theorem for hypergraphs
- Partitioning a graph into degenerate subgraphs
- Spectral radius of \(\{0,1\}\)-tensor with prescribed number of ones
- On the first and second eigenvalue of finite and infinite uniform hypergraphs
Cited In (2)
This page was built for publication: The high order spectrum of a graph and its applications in graph colouring and clique counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133767)