Categorifying connected domination via graph überhomology

DOI10.1016/J.JPAA.2023.107381zbMATH Open1521.18012arXiv2201.00721OpenAlexW4327718197MaRDI QIDQ6038540FDOQ6038540

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)

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.

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Strong collapse and persistent homology
• Filtered simplicial homology, graph dissimilarity and überhomology

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)