The high order spectrum of a graph and its applications in graph colouring and clique counting

DOI10.1080/03081087.2022.2103490MaRDI QIDQ6133767zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

tensorchromatic numberspectrumcliques

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3317680 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• k-Degenerate Graphs
• A Course in Enumeration
• A Harary-Sachs theorem for hypergraphs
• Analogue of the identity Log Det = Trace Log for resultants
• Analytic methods for uniform hypergraphs
• Cliques and the spectral radius
• Decomposing a planar graph into degenerate graphs
• Eigenvalues of a real supersymmetric tensor
• Further results for Perron-Frobenius theorem for nonnegative tensors
• Large induced degenerate subgraphs
• Note on the colouring of graphs
• On determinants and eigenvalue theory of tensors
• On the first and second eigenvalue of finite and infinite uniform hypergraphs
• Partitioning a graph into degenerate subgraphs
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Some new trace formulas of tensors with applications in spectral hypergraph theory
• Some spectral properties of uniform hypergraphs
• Spectra of uniform hypergraphs
• Spectral radius of \(\{0,1\}\)-tensor with prescribed number of ones
• The Eigenvalues of a Graph and Its Chromatic Number
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• The Laplacian of a uniform hypergraph
• The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
• The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs

Cited in

(2)

• The high order spectral extremal results for graphs and their applications
• On a generalization of the spectral Mantel's theorem

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)