Critical concepts of restrained domination in signed graphs

Title

Critical concepts of restrained domination in signed graphs

Creator

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

Description

A signed graph ? is a simple undirected graph in which each edge is either positive or negative. Restrained dominating set D in ? is a restrained dominating set of the underlying graph |?| where the subgraph induced by the edges across ?[D: V D] and within V D is balanced. The minimum cardinality of a restrained dominating set of ? is called the restrained domination number, denoted by ?r(?). In this paper, we initiate the study on various critical concepts to investigate the effect of edge removal or edge addition on restrained domination number in signed graphs. 2022 World Scientific Publishing Company.

Source

Discrete Mathematics, Algorithms and Applications, Vol-14, No. 6

Date

2022-01-01

Publisher

World Scientific

Subject

critical concepts; restrained domination number; Signed graphs

Coverage

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

Rights

Restricted Access

Relation

ISSN: 17938309

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S1793830922500100

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85114109276&doi=10.1142%2fS1793830922500100&partnerID=40&md5=413a4440d6ed9501687c54e2e24ebe68