• Dr.P.Vidhya
• S.Jayalakshmi

The join matrix [S] fonSwithrespect to a function f : P → C is defined as ([S]f)ij= f (xi˅xj).If f(xi˅xj) = 2xi˅xj-1, then the n × n join matrix obtained is called the Mersenne join matrix on S. A recursive structure theorem for Mersenne join matrices on A-sets is verified and a recursive formula for det[S]fand for 〖〖[S]〗_f〗^(-1)on A-sets is also verified. The recursive formulaealso yield explicit formulae, e.g. the known determinant and inverse formulae on chainsand a-sets

Join Matrices, Mersenne Join Matrices, a- Set, A-Set

" Complementary Tree Domination in Subdivision graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 1, page no.31-37, January-2019, Available :http://www.jetir.org/papers/JETIRR006005.pdf

" Complementary Tree Domination in Subdivision graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 1, page no. pp31-37, January-2019, Available at : http://www.jetir.org/papers/JETIRR006005.pdf