The -competition graph of a digraph is a graph with , where an edge between distinct vertices and if and only if there exist distinct vertices such that are arcs of the digraph for each . In this paper, we prove that double stars () are -competition graphs. We also show that full regular -ary trees with height are -competition graphs, where .
Keywords: -competition graph, double star, full regular -ary tree.