Graphs of morphisms of graphs

MaRDI QIDQ1010650zbMATH OpenFDO

Authors Ronald Brown, I. Morris, J. Shrimpton, C. D. Wensley

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/117194, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1a1.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Cartesian closed categorydigraphgraphtopos

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Special categories (18B99) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Review text

Summary: This is an account for the combinatorially minded reader of various categories of directed and undirected graphs, and their analogies with the category of sets. As an application, the endomorphisms of a graph are in this context not only composable, giving a monoid structure, but also have a notion of adjacency, so that the set of endomorphisms is both a monoid and a graph. We extend Shrimpton's (unpublished) investigations on the morphism digraphs of reflexive digraphs to the undirected case by using an equivalence between a category of reflexive, undirected graphs and the category of reflexive, directed graphs with reversal. In so doing, we emphasise a picture of the elements of an undirected graph, as involving two types of edges with a single vertex, namely `bands' and `loops'. Such edges are distinguished by the behaviour of morphisms with respect to these elements.

Recommendations

• Endomorphisms of undirected modifications of directed graphs
• Automorphisms of endomorphism semigroups of reflexive digraphs
• A category of ``undirected graphs. A tribute to Hartmut Ehrig
• Endomorphisms of graphs. II: Various unretractive graphs
• Endomorphisms of graphs. I: The monoid of strong endomorphisms

Cited in

(17)

• Extending morphisms of groups and graphs
• Endomorphisms of undirected modifications of directed graphs
• The category of matroids
• About graph mappings
• Symmetric Heyting relation algebras with applications to hypergraphs
• Parameterized algorithms for min-max multiway cut and list digraph homomorphism
• Relations on hypergraphs
• Mutation classes of diagrams via infinite graphs
• scientific article; zbMATH DE number 3906544 (Why is no real title available?)
• scientific article; zbMATH DE number 4051663 (Why is no real title available?)
• scientific article; zbMATH DE number 579476 (Why is no real title available?)
• scientific article; zbMATH DE number 1833779 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 7692359 (Why is no real title available?)
• Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials
• Automorphisms and homotopies of groupoids and crossed modules
• A categorical approach to additive combinatorics

This page was built for publication: Graphs of morphisms of graphs

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