Ascending Bi-Pendant Domination Decomposition of Path and Cycle
V. Brishni, V. Uma Maheswari, K. Bala Deepa Arasi · Journal of Physics Conference Series · 2021
Abstract Let G = (V, E) be a simple connected graph. A pendant dominating set S of a graph G is a bi-pendant dominating set if V-S also contains pendant vertex. The least cardinality of the bi-pendant dominating set in G is called the bi-pendant domination number of G denoted by γ b p e (G). If G 1, G 2, G 3, …, G n are connected edge disjoint sub graphs of G with E(G) = E(G 1) ∪ E(G 2) ∪ E(G 3) …∪ E(G n ), then G 1, G 2, G 3, …, G n is said to be decomposition of G. In this paper, we define Ascending Bi-Pendant Domination Decomposition (ABPDD) and discuss the values of m in P m and C m which admits APBDD into n-parts.