Partial profiles of quasi-complete graphs
Journal of integer sequences, Tome 19 (2016) no. 2
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.
Classification :
05A15, 05C15
Keywords: enumeration, sequence of integers, graph, graph homomorphism, complete graph, quasi-complete graph, path, cycle, wheel, broken wheel, lovász vector of graph (profile of graph)
Keywords: enumeration, sequence of integers, graph, graph homomorphism, complete graph, quasi-complete graph, path, cycle, wheel, broken wheel, lovász vector of graph (profile of graph)
@article{JIS_2016__19_2_a6,
author = {Lopes, Pedro},
title = {Partial profiles of quasi-complete graphs},
journal = {Journal of integer sequences},
year = {2016},
volume = {19},
number = {2},
zbl = {1336.05064},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2016__19_2_a6/}
}
Lopes, Pedro. Partial profiles of quasi-complete graphs. Journal of integer sequences, Tome 19 (2016) no. 2. http://geodesic.mathdoc.fr/item/JIS_2016__19_2_a6/