Abstract. Let j ≥ 3. Given that m j (H,G) denotes the smallest positive integer s such that K j×s →(H,G). In this paper, we exhaustively find m j (P 4 ,G) for all 11 non-isomorphic graphs G on 4 vertices, out of which 6 graphs G are connected and the others are disconnected.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.