Affiliation:
1. Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, Karnataka 560029, India
Abstract
A signed graph [Formula: see text] is a simple undirected graph in which each edge is either positive or negative. Restrained dominating set [Formula: see text] in [Formula: see text] is a restrained dominating set of the underlying graph [Formula: see text] where the subgraph induced by the edges across [Formula: see text] and within [Formula: see text] is balanced. The minimum cardinality of a restrained dominating set of [Formula: see text] is called the restrained domination number, denoted by [Formula: see text]. 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.
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the (total) restrained double Italian domination of central of graphs;Discrete Mathematics, Algorithms and Applications;2023-12-08
2. Further results on (total) restrained Italian domination;Discrete Mathematics, Algorithms and Applications;2023-03-25
3. RESTRAINED CRITICAL AND ABUNDANT SIGNED GRAPHS;Advances and Applications in Discrete Mathematics;2023-03-15