2026-09-20T23:03:07Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/870 2021-12-13T05:58:09Z 1582963739756:1582967046255 user-um

Characterization of Bipartite Graphs With given Hamiltonicity Zaw Myint 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. 2012 http://hdl.handle.net/20.500.12678/0000000870 https://meral.edu.mm/records/870