Restrained domination in signed graphs-Reference-Cited by-同舟云学术

Restrained domination in signed graphs

Published:2020-07-01 Issue:1 Volume:12 Page:155-163
ISSN:2066-7752
Container-title:Acta Universitatis Sapientiae, Mathematica
language:en
Short-container-title:

Author:

Mathias Anisha Jean¹,Sangeetha V.²,Acharya Mukti¹

Affiliation:

1. Department of Mathematics , CHRIST (Deemed to be University)

2. Assistant Professor Department of Mathematics CHRIST (Deemed to be University)

Abstract

Abstract A signed graph Σ is a graph with positive or negative signs attatched to each of its edges. A signed graph Σ is balanced if each of its cycles has an even number of negative edges. Restrained dominating set D in Σ is a restrained dominating set of its underlying graph where the subgraph induced by the edges across Σ[D : V \ D] and within V \ D is balanced. The set D having least cardinality is called minimum restrained dominating set and its cardinality is the restrained domination number of Σ denoted by γr(Σ). The ability to communicate rapidly within the network is an important application of domination in social networks. The main aim of this paper is to initiate a study on restrained domination in the realm of different classes of signed graphs.

Publisher

Walter de Gruyter GmbH

Subject

General Mathematics

Link

https://www.sciendo.com/pdf/10.2478/ausm-2020-0010

Reference9 articles.

1. [1] F. Harary, Graph theory, Addison-Wesley, Reading, MA, 1969.10.21236/AD0705364

2. [2] T. Zaslavsky, Signed graphs, Discrete Applied Mathematics, 4 (1982), 47–74.10.1016/0166-218X(82)90033-6

3. [3] F. Harary, On the notion of balance of a signed graph, The Michigan Mathematical Journal, 2 (1953), 143–146.10.1307/mmj/1028989917

4. [4] T. W. Haynes, S. Hedetniemi, P. Slater, Fundamentals of domination in graphs, CRC press, 2013.10.1201/9781482246582

5. [5] B. D. Acharya, Domination and absorbance in signed graphs and di-graphs. I: Foundations, The Journal of Combinatorial Mathematics and Combinatorial Computing, 84 (2013), 1–10.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On domination in signed graphs;Acta Universitatis Sapientiae, Informatica;2023-08-01

2. RESTRAINED CRITICAL AND ABUNDANT SIGNED GRAPHS;Advances and Applications in Discrete Mathematics;2023-03-15

3. Negative Domination in Networks;Lecture Notes in Networks and Systems;2022

4. Critical concepts of restrained domination in signed graphs;Discrete Mathematics, Algorithms and Applications;2021-08-31