A t coloring of a hypergraph \$H=(V

E)\$ is a surjective mapping from the vertex set \$V\$ onto a t element set.A t coloring \$f\$ of \$H\$ separates an edge \$α∈E\$ if the images of the vertices in \$α\$ under \$f\$ are all different.We call \$f\$ heterochromatic if \$f\$ separates at least one edge of \$H\$

otherwise \$f\$

noheterochromatic.The heterochromatic number of \$H

\$ denoted by \$hc(H)

\$is the minimum positive integer \$t\$ for which any t coloring of \$H\$ is heterochromatic.In this paper

we introduce a class of hypergraphs and obtain their heterochromatic numbers.\;