A study on the restrained domination number in diverse families of derived signed graphs

Title

A study on the restrained domination number in diverse families of derived signed graphs

Creator

Mathias, Anisha Jean; Sangeetha, Veerasamy; Acharya, Mukti

Description

A derived graph is obtained by applying a specific graph operation to a given graph G. A set D of vertices in a signed graph ? is a restrained dominating set of ? if D is a restrained dominating set of the underlying graph |?|, and every cycle formed by the edges connecting D to V \D and those within V \D is balanced. The restrained domination number ?r(?) is the minimum cardinality of a restrained dominating set of ?. In this paper, we establish results on the restrained domination number for derived signed graphs, including line signed graphs, semi-total point signed graphs, semi-total line signed graphs, and total signed graphs and we also examine their structural properties in relation to their restrained domination number. 2025 World Scientific Publishing Company.

Source

Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550037;

Date

01-01-2025

Publisher

World Scientific

Subject

line signed graph; Restrained domination number; semi-total line signed graph; semi-total point signed graph; total signed graph

Coverage

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

Rights

Restricted Access; Hardcopy may be available in the library

Relation

ISSN: 17938309;

Format

online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S1793830925500375

https://www.scopus.com/pages/publications/86000649506?origin=resultslist