Relations Between Graphs
Combinatorics
2012-10-18 v3
Abstract
Given two graphs G and H, we ask under which conditions there is a relation R that generates the edges of H given the structure of graph G. This construction can be seen as a form of multihomomorphism. It generalizes surjective homomorphisms of graphs and naturally leads to notions of R-retractions, R-cores, and R-cocores of graphs. Both R-cores and R-cocores of graphs are unique up to isomorphism and can be computed in polynomial time.
Cite
@article{arxiv.1205.3983,
title = {Relations Between Graphs},
author = {Jan Hubicka and Jürgen Jost and Yangjing Long and Peter F. Stadler and Ling Yang},
journal= {arXiv preprint arXiv:1205.3983},
year = {2012}
}
Comments
accepted by Ars Mathematica Contemporanea