Roman domination in signed graphs

Title

Roman domination in signed graphs

Creator

Joseph J.; Joseph M.

Description

Let S = (G, ?) be a signed graph. A function f : V ? {0, 1, 2} is a Roman dominating function on S if (i) for each v ? V, f(N[v]) = f(v) + Pu?N(v) ?(uv)f(u) ? 1 and (ii) for each vertex v with f(v) = 0, there exists a vertex u ? N+(v) such that f(u) = 2. In this paper we initiate a study on Roman dominating function on signed graphs. We characterise the signed paths, cycles and stars that admit a Roman dominating function. 2023 Azarbaijan Shahid Madani University.

Source

Communications in Combinatorics and Optimization, Vol-8, No. 2, pp. 349-358.

Date

2023-01-01

Publisher

Azarbaijan Shahid Madani University

Subject

Dominating functions; Roman dominating functions; Signed graphs

Coverage

Joseph J., Department of Mathematics, CHRIST(Deemed to be University), Bangalore, India; Joseph M., Department of Mathematics, CHRIST(Deemed to be University), Bangalore, India

Rights

Restricted Access

Relation

ISSN: 25382128

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.22049/cco.2022.27438.1264

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85148854944&doi=10.22049%2fcco.2022.27438.1264&partnerID=40&md5=f72913886990ba93fbef072ec8433977