Isnaini Rosyida, Wakhid Fitri Albar, Muhammad Habiburrohman, Emi Pujiastuti, Mary D. Jiny
Given a fuzzy set (Formula Presented), a graph (Formula Presented) is called a fuzzy labeling (Formula Presented) are bijective membership functions such that every vertex and edge receive a unique membership degree and μ satisfies (Formula Presented) A graph formed from a single vertex connected to the 1 vertices of a cycle of length n is called a wheel graph. In this research, an algorithm for fuzzy labeling of a wheel graph is constructed. We also examine the strong fuzzy resolving set (SFRS) of the fuzzy labeling wheel graph with n number (Formula Presented). © 2025 Pushpa Publishing House, Prayagraj, India.
Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri, Semarang, 50229, Indonesia; Department of Mathematics, Saveetha School of Engineering, SIMATS, Chennai, India
