Rooted Product and Restricted Rooted Product of Soft Directed Graphs

Abstract

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. A graph with directed edges is known as a directed graph. Studying and resolving issues with social networks, shortest paths, electrical circuits, etc. using directed graphs is possible. We presented 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 work, we introduce the rooted product and the restricted rooted product of soft directed graphs and examine some of their properties.