Simplification for Graph-like Objects

arXiv2012.08772MaRDI QIDQ6504298FDOQ6504298

Abstract: This paper constructs an operation for a comma category, which generalizes the simplification operations for various types of graphs. In studying the categories of simple graphs, the category of undirected graphs is both a reflective and a coreflective subcategory of the category of directed graphs. Moreover, the simplification can be dualized, creating a "cosimplification" of graphs. Depending on the morphisms of the category, cosimplification can manifest as removal of isolated vertices or as traditional removal of parallel edges.

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Functor categories, comma categories (18A25)

This page was built for publication: Simplification for Graph-like Objects

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