Homomorphic product of soft directed graphs

Abstract

A graph with directed edges is referred to be directed graph. It is possible to study and resolve problems with social connections, shortest paths, electrical circuits, etc. using directed graphs. D. Molodtsov proposed soft set theory as a mathematical framework for handling uncertain data. Nowadays, a lot of people employ soft set theory to solve decision-making problems. We present soft directed graphs by extending the notion of soft set to directed graphs. A parameterized perspective for directed graphs is provided by soft directed graphs. In this study, we look at various characteristics of soft directed graphs’ homomorphic product and restricted homomorphic product.