VERTEX BIMAGIC TOTAL LABELINGS TO COMPLEMENTARY PERFECT TRIPLE CONNECTED DOMINATION NUMBER FOR SOME STANDARD GRAPHSJournal: International Journal of Engineering Sciences & Research Technology (IJESRT) (Vol.5, No. 10)
Publication Date: 2016-10-30
Authors : S. Arunkumar; R. Senthil Amutha;
Page : 733-737
Keywords : Dominating set; CPTC Dominating set; VBTL and Standard graphs;
A set S is a complementary perfect triple connected dominating set, if ? is a triple connected dominating set of G and the induced sub graph < ? ? ? > has a perfect matching. The complementary perfect triple connected domination number ? ???? ( ? ) is the minimum cardinality taken over all complementary perfect triple connected dominating sets in G . A graph labeling is a one to one function that carrie s a set of elements onto set of integers called labels. Here we discuss some standard graphs which has vertex bimagic labelings and for which complementary perfect triple connected domination number exists.
Other Latest Articles
Last modified: 2016-10-26 21:46:00