Co-Secure Domination in Jump Graphs for Enhanced Security

Manjusha Pothuvath, Radha Rajamani Iyer, Ahmad Asiri and Kanagasabapathi Somasundaram ()
Additional contact information
Manjusha Pothuvath: Department of Mathematics, Amrita School of Physical Sciences, Amrita Vishwa Vidyapeetham, Kochi 682024, India
Radha Rajamani Iyer: Department of Mathematics, Amrita School of Physical Sciences, Amrita Vishwa Vidyapeetham, Coimbatore 641112, India
Ahmad Asiri: Department of Mathematics, Applied College at Mahail Aseer, King Khalid University, Asir-Abha 61421, Saudi Arabia
Kanagasabapathi Somasundaram: Department of Mathematics, Amrita School of Physical Sciences, Amrita Vishwa Vidyapeetham, Coimbatore 641112, India

Mathematics, 2024, vol. 12, issue 19, 1-11

Abstract: This study proposes a general approach to protect graphs using co-secure domination within jump graphs. In the context of graphs, a dominating set is a group of vertices that are either directly linked or connected to all other vertices within the graph. The minimum cardinality of the dominating set in a graph G is called the domination number γ ( G ) . A set S ⊆ V of a graph G is called a co-secure dominating set, if, for all u ∈ S , there exists a node v ∈ N ( u ) and in V ∖ S so that ( S ∖ { u } ) ∪ { v } dominates the graph G . γ c s ( G ) , the co-secure domination number, is the cardinality of a co-secure dominating set with minimum vertices within the graph G . It is a notable protective strategy in which the nodes that are attacked or damaged in an interconnection network can be replaced with alternative nodes to ensure network security. In a jump graph J ( G ) , the vertices are the edges of G and the adjacency of the vertices of J ( G ) are given by the condition that these edges are not adjacent in G . This paper explains how γ ( G ) and γ c s ( J ( G ) ) are related for the jump graph of various graph classes. The study further determines the exact value for γ c s ( J ( G ) ) of specific standard graphs. Additionally, the study characterizes γ c s ( J ( G ) ) = 2 and a tight bond is identified for γ c s ( J ( G ) ) , particularly for G with specific conditions.

Keywords: co-secure domination number; domination number; jump graph (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/19/3077/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/19/3077/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:19:p:3077-:d:1490297

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().