一些联图的anti-Ramsey数

Anti-Ramsey numbers in some join graphs

图的anti-Ramsey数ar(G,H)表示图G的最大边染色数,使得图G不含彩虹的子图H.本文主要研究一些联图的anti-Ramsey数,包括C_(n)∨K_(s)、P_(n)∨K_(s)、W_(n)∨K_(s)和F_(n)∨K_(s),其中子图主要包括短圈和三角形加一条悬挂边.

The anti-Ramsey number ar(G,H)is the maximum number of colors in an edge-coloring of G such that G contains no rainbow subgraphs isomorphic to H.In this paper,we primarily study the anti-Ramsey numbers in some joins of graphs,including C_(n)∨K_(s),P_(n)∨K_(s),W_(n)∨K_(s) and F_(n)∨K_(s),whereas those subgraphs include short cycles and the triangle with a pendant edge.