Coloring the normalized Laplacian for oriented hypergraphs

DOI10.1016/J.LAA.2021.07.018MaRDI QIDQ1979369zbMATH OpenOpenAlexFDO

Authors Aida Abiad, R. Mulas, Dong Zhang

Publication date 2 September 2021

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

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

zbMATH Keywords

coloring numberindependence numberLaplace operatororiented hypergraphsspectrum

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65)

Recommendations

• Normalized Laplacian eigenvalues with chromatic number and independence number of graphs
• Lower bounds for the Laplacian spectral radius of an oriented hypergraph
• Spectral properties of oriented hypergraphs
• Signless normalized Laplacian for hypergraphs
• Spectral bounds for the independence ratio and the chromatic number of an operator

Cites work

• A characterization of oriented hypergraphic balance via signed weak walks
• A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
• A lower bound on the independence number of arbitrary hypergraphs
• An oriented hypergraphic approach to algebraic graph theory
• Approximate graph coloring by semidefinite programming
• Counting independent sets in regular hypergraphs
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 5158519 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• scientific article; zbMATH DE number 7352045 (Why is no real title available?)
• scientific article; zbMATH DE number 3377258 (Why is no real title available?)
• Hypergraph Laplace operators for chemical reaction networks
• Independence numbers of hypergraphs with sparse neighborhoods.
• Independent sets in hypergraphs with a forbidden link
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• Intersection graphs of oriented hypergraphs and their matrices
• Lower bounds for the Laplacian spectral radius of an oriented hypergraph
• Normalized Laplacian eigenvalues with chromatic number and independence number of graphs
• On chromatic number of graphs and set-systems
• On independent sets in hypergraphs
• On the independence number of non-uniform uncrowded hypergraphs
• On the number of independent sets in simple hypergraphs
• On the number of independent sets in uniform, regular, linear hypergraphs
• On vertex independence number of uniform hypergraphs
• Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
• Oriented hypergraphs: introduction and balance
• Sharp bounds for the largest eigenvalue
• Sparse hypergraphs with low independence number
• Spectra of cycle and path families of oriented hypergraphs
• Spectra of graphs
• Spectral properties of oriented hypergraphs
• The sandwich theorem

Cited in

(7)

• Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
• Colouring the normalized Laplacian
• Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
• There is no going back: properties of the non-backtracking Laplacian
• Coloring the normalized Laplacian for oriented hypergraphs
• Coloring outside the lines: spectral bounds for generalized hypergraph colorings
• Spectra of complex unit hypergraphs

This page was built for publication: Coloring the normalized Laplacian for oriented hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979369)