isolate pendant domination number in semi-total point graphs and its application
Let G be a non-trivial graph. A dominating set I ⊂ V (G) is called an Isolate Pendant Dominating set (IPD-set) if the induced subgraph 〈I〉 has maximum degree at most one and contains at least one isolate vertex and at least one pendant vertex. The minimum cardinality of an IPD-set is called the IP domination number a...