An annihilator dominating set ADS is a representative technique for nd-ing the induced subgraph of a graph which can help to isolate the vertices. A dominating set of graph G is called ADS if its induced subgraph is containing only isolated vertices. The annihilator domination number of G, denoted by a G is the minimum cardinality of ADS. The tensor product of graphs G and H signied by G H is a graph with vertex set V = V G V H and edge f u; v ; u0; v0 g 2 E whenever u; u0 2 E G and v; v0 2 E H . In this paper, we deduce exact values of annihilator domination number of tensor product of Pm and Pn, m; n 2. Further, we investigated some lower and upper bounds for annihilator domination number of tensor product of path graphs.
Domination Number, Annihilator Dominating Set, Annihilator Domination Number, Paths, Tensor Product.
Primary Language | English |
---|---|
Journal Section | Research Article |
Authors |
|
Publication Date | December 1, 2019 |
Published in Issue | Year 2019, Volume 9, Issue 4 |
Bibtex | @ { twmsjaem760952, journal = {TWMS Journal of Applied and Engineering Mathematics}, issn = {2146-1147}, eissn = {2587-1013}, address = {Işık University ŞİLE KAMPÜSÜ Meşrutiyet Mahallesi, Üniversite Sokak No:2 Şile / İstanbul}, publisher = {Turkic World Mathematical Society}, year = {2019}, volume = {9}, number = {4}, pages = {800 - 809}, title = {ANNIHILATOR DOMINATION NUMBER OF TENSOR PRODUCT OF PATH GRAPHS}, key = {cite}, author = {Sharma, K. and Sharma, U.} } |