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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
