Coloring the normalized Laplacian for oriented hypergraphs

DOI10.1016/j.laa.2021.07.018OpenAlexW3048261882MaRDI QIDQ1979369

Aida Abiad, Dong Zhang, Raffaella Mulas

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

spectrumLaplace operatorindependence numbercoloring numberoriented hypergraphs

Mathematics Subject Classification ID

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

Related Items (3)

Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology ⋮ There is no going back: properties of the non-backtracking Laplacian ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Oriented hypergraphs: introduction and balance
• On vertex independence number of uniform hypergraphs
• An oriented hypergraphic approach to algebraic graph theory
• Spectra of graphs
• A characterization of oriented hypergraphic balance via signed weak walks
• On the independence number of non-uniform uncrowded hypergraphs
• The sandwich theorem
• Independence numbers of hypergraphs with sparse neighborhoods.
• On the number of independent sets in simple hypergraphs
• A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
• Sparse hypergraphs with low independence number
• Hypergraph Laplace operators for chemical reaction networks
• Sharp bounds for the largest eigenvalue
• Counting independent sets in regular hypergraphs
• On the number of independent sets in uniform, regular, linear hypergraphs
• Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
• Spectra of cycle and path families of oriented hypergraphs
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• Intersection Graphs of Oriented Hypergraphs and Their Matrices
• Approximate graph coloring by semidefinite programming
• A lower bound on the independence number of arbitrary hypergraphs
• Independent sets in hypergraphs with a forbidden link
• Normalized Laplacian eigenvalues with chromatic number and independence number of graphs
• On independent sets in hypergraphs
• Spectral properties of oriented hypergraphs
• On chromatic number of graphs and set-systems

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