Restrained domination in signed graphs

Title

Restrained domination in signed graphs

Creator

Mathias A.J.; Sangeetha V.; Acharya M.

Description

A signed graph ? is a graph with positive or negative signs attatched to each of its edges. A signed graph ? is balanced if each of its cycles has an even number of negative edges. Restrained dominating set D in ? is a restrained dominating set of its underlying graph where the subgraph induced by the edges across ?[D: V\D] and within V\D is balanced. The set D having least cardinality is called minimum restrained dominating set and its cardinality is the restrained domination number of ? denoted by ?r(?). The ability to communicate rapidly within the network is an important application of domination in social networks. The main aim of this paper is to initiate a study on restrained domination in the realm of different classes of signed graphs. 2020 Anisha Jean Mathias et al., published by Sciendo 2020.

Source

Acta Universitatis Sapientiae, Mathematica, Vol-12, No. 1, pp. 155-163.

Date

2020-01-01

Publisher

Sciendo

Subject

dominating set; restrained dominating set; restrained domination number; signed graphs

Coverage

Mathias A.J., Department of Mathematics, Christ (Deemed to Be University), IN; Sangeetha V., Department of Mathematics, Christ (Deemed to Be University), IN; Acharya M., Department of Mathematics, Christ (Deemed to Be University), IN

Rights

All Open Access; Gold Open Access

Relation

ISSN: 18446094

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.2478/ausm-2020-0010

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85089193094&doi=10.2478%2fausm-2020-0010&partnerID=40&md5=edd96fb04b118b7a6b5d082f12ae80b4