Negative Domination inNetworks
- Title
- Negative Domination inNetworks
- Creator
- Ranjith A.P.; Kureethara J.V.
- Description
- We introduce s-domination in signed graphs which is based on the number of negative edges between the dominating set and its complement. The s-domination in both the positive and negative homogeneous signed graph will be studied for each value of s. As a special case, the properties of s-domination in sum signed graphs will be analyzed. The maximum value of s for a graph for which the s-domination exists is identified. 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
- Source
- Lecture Notes in Networks and Systems, Vol-351, pp. 679-690.
- Date
- 2022-01-01
- Publisher
- Springer Science and Business Media Deutschland GmbH
- Subject
- Domination in networks; Signed graph; Sum signed graph
- Coverage
- Ranjith A.P., Christ University, Bangalore, 560029, India; Kureethara J.V., Christ University, Bangalore, 560029, India
- Rights
- Restricted Access
- Relation
- ISSN: 23673370; ISBN: 978-981167656-7
- Format
- Online
- Language
- English
- Type
- Conference paper
Collection
Citation
Ranjith A.P.; Kureethara J.V., “Negative Domination inNetworks,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 25, 2025, https://archives.christuniversity.in/items/show/20409.