Graph embedding, a fundamental technique in the realm of architecture simulation for parallel algorithms and interconnection network simulations, serves as the cornerstone of this research. In this paper, our objective is to explore the embedding of folded hypercube structures into wheel-like networks, with a particular focus on fan and windmill graphs. Moreover, this research presents a comprehensive comparison between the wirelength efficiencies of fan and windmill graph embeddings, providing valuable insights into the field. Leveraging graphical representation, this comparative analysis offers a visually intuitive means to identify the superior network configuration with minimum wirelength for optimal system performance.