Partial profiles of quasi-complete graphs

MaRDI QIDQ2808554zbMATH OpenFDO

Authors Pedro Lopes

Publication date 24 May 2016

Published in Journal of Integer Sequences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0802.2342, http://www.emis.de/journals/JIS/VOL19/Lopes/lopes3.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

graphenumerationgraph homomorphismcyclewheelcomplete graphpathsequence of integersbroken wheelprofile of a graphquasi-complete graphLovász vector of graph

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30)

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.

Recommendations

• scientific article; zbMATH DE number 4047782
• On a certain homomorphism properties of graphs II.
• Extremal graphs for homomorphisms
• Enumeration of labeled and unlabeled Hamiltonian cycles in complete k-partite graphs
• scientific article; zbMATH DE number 5606398

This page was built for publication: Partial profiles of quasi-complete graphs

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