Abstract

Soft graph theory offers a parametrized perspective on graphs by classifying the universe’s components according to a specified set of parameters. This paper explores soft graph theory, which classifies graph components based on a set of parameters, focusing on the wheel and friendship graph families. By analyzing soft graphs with distance-based parameter sets, the study provides key results on the isomorphic subgraphs formed within these structures. These findings offer important insights into the structure and behavior of soft graphs, enhancing our understanding of soft graph theory.