We show that the decision problem for total outer-connected vertex-edge domination problem is N P N P -Complete even for bipartite graphs. We prove that for every tree of order n ≥ 3 n ≥ 3 with l l ...

The co-normal product, the restricted co-normal product, the modular product, and the restricted modular product of soft graphs are all introduced in this study. We prove that these products of soft ...