Unique Response Roman Domination: Complexity and Algorithms

A function f : V ( G ) → { 0 , 1 , 2 } is called a Roman dominating function on G = ( V ( G ) , E ( G ) ) if for every vertex v with f ( v ) = 0 , there exists a vertex u ∈ N G ( v ) such that f ( u ) = 2 . A function f : V ( G ) → { 0 , 1 , 2 } induces an ordered partition ( V 0 , V 1 , V 2 ) of V...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 85; no. 12; pp. 3889 - 3927
Main Authors:	Banerjee, Sumanta, Chaudhary, Juhi, Pradhan, Dinabandhu
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.12.2023 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Approximation Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Graphs Mathematical functions Mathematics of Computing Minimum weight Polynomials Theory of Computation Domination Roman domination Polynomial-time algorithm Unique response Roman domination Unique response Roman function NP-completeness
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!