Partial profiles of quasi-complete graphs
Combinatorics
2016-01-26 v2
Abstract
We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These enumerations give rise to sequences of integers with two indices; one of the indices is the number of vertices of the source graph, and the other index is the number of vertices of the target graph.
Cite
@article{arxiv.0802.2342,
title = {Partial profiles of quasi-complete graphs},
author = {Pedro Lopes},
journal= {arXiv preprint arXiv:0802.2342},
year = {2016}
}
Comments
21 pages, 5 figures