Please use this identifier to cite or link to this item:
Characterization of Bipartite Graphs With given Hamiltonicity
- In this paper, we first give a characterization of the bipartite graphs G satisfying Moreover, we compare the value of 2-domination number and independence number in trees and give bounds on these two parameters in terms of the order and the number of pendant vertices of the tree. More precisely we show that for a nontrivial tree T, (n(T) + +2)/3 (n(T) + )/2 and (n(T) + – 1)/2. Finally, we characterize the trees achieving equality in each bound.
- Myingyan degree college Research Journal