“…The inducibility of some family of graphs have been determined, i.e., complete graph K k [19], complete bipartite graph K ρ,ρ ,K ρ,ρ+1 [19] and complete multipartite graphs K k,...,k [17]. Inducibility of various graph classes have also been studied, such as d-ary trees [6], rooted trees [7], directed paths [5], oriented stars [16], net graphs [2] and random Cayley graphs [12]. The precise inducibility of paths of order k ≥ 4 or cycles of order k ≥ 6 are still unknown [11].…”