Total k-rainbow domination in graphs

Title

Total k-rainbow domination in graphs

Creator

Kumbargoudra P.; Kureethara J.V.

Description

In the modem world a huge concern among people is about their security\ People in the planning and execution focus much about proper security. This is a paper on the Mathematical aspects of some type of security enhancement. If a system is have various nodes and if there is availability of multiple types of security instruments, how will we ensure that every security is used to secure every node in an optimal way? We answer this question here by defining a graph theoretic model named Total k-Rainbow Domination. Here k stands for k types of security instruments. Easiest case is that of k types of cops. We define the optimal value as total k-rainbow domination number. Total k-rainbow domination numbers of certain graphs are calculated. IAEME Publication.

Source

International Journal of Civil Engineering and Technology, Vol-8, No. 6, pp. 867-875.

Date

2017-01-01

Publisher

IAEME Publication

Subject

Control; Design; Domination; Managing locations; Planning; Secure systems; Security

Coverage

Kumbargoudra P., Department of Mathematics, Christ University, Bengaluni, India; Kureethara J.V., Department of Mathematics, Christ University, Bengaluni, India

Rights

Restricted Access

Relation

ISSN: 9766308

Format

Online

Language

English

Type

Article

Identifier

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021995990&partnerID=40&md5=431f1dd927d9ab29ef6297bc3aef8dd7