Categorifying connected domination via graph überhomology

DOI10.1016/J.JPAA.2023.107381MaRDI QIDQ6038540zbMATH OpenOpenAlexFDO

Authors Luigi Caputi, Daniele Celoria, Carlo Collari

Publication date 2 May 2023

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph complexes and graph homology (18G85) Categorification (18N25) Discrete Morse theory and related ideas in manifold topology (57Q70)

Abstract: "Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of "uberhomology, is related to dominating sets in graphs. To this end, we interpret "uberhomology as a poset homology, and investigate its functoriality properties. We then show that the Euler characteristic of the bold homology of a graph coincides with an evaluation of its connected domination polynomial. Even more, the bold chain complex retracts onto a complex generated by connected dominating sets. We conclude with several computations of this homology on families of graphs; these include a vanishing result for trees, and a characterisation result for complete graphs.

Recommendations

• Filtered simplicial homology, graph dissimilarity and überhomology
• Domination numbers and homology
• Homology theory of graphs
• Categorifying the magnitude of a graph
• On the homotopy type of complexes of graphs with bounded domination number

Cites work

• A 2-category of chronological cobordisms and odd Khovanov homology
• A categorification of the Jones polynomial
• Combinatorial algebraic topology
• Connected domination polynomial of graphs
• Filtered matchings and simplicial complexes
• Homology of coloured posets: A generalisation of Khovanov's cube construction
• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 3297895 (Why is no real title available?)
• Introduction to domination polynomial of a graph.
• Morse theory for cell complexes
• On discrete Morse functions and combinatorial decompositions
• On domination and independent domination numbers of a graph
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Vizing's conjecture: a survey and recent results

Cited in

(4)

• Strong collapse and persistent homology
• Filtered simplicial homology, graph dissimilarity and überhomology
• From the Mayer-Vietoris spectral sequence to überhomology
• Multipath matroids, digraph colourings, and the Tutte polynomial

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Categorifying connected domination via graph überhomology

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