This research aims to introduce the concept of Plus Weighted Digraph and its connectivity properties.
Define Plus Weighted Digraph and analyze its characteristics.
Demonstrate strong connectivity through the existence of cycles.
Utilize Eulerian concepts to establish further properties.
Confirmed that Plus Weighted Digraph is strongly connected if it contains a cycle.
Proved the existence of an Eulerian Plus Weighted Digraph under specific conditions.
Abstract
The main objective of this study is to present the Plus Weighted Digraph (pwd) and demonstrate that it is strongly connected if pwd has a cycle and an Eulerian Plus Weighted Digraph exists.