| Naslov: | Complete co-secure domination in graphs |
|---|
| Avtorji: | ID Saraswathy, Gisha (Avtor)
ID Menon, Manju K. (Avtor) |
|---|
| Datoteke: |  ADAM_Saraswathy,_Menon_2026.pdf (437,20 KB)
MD5: BD1E2802BEECBEA316C2D5B47966E90E
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Članek v reviji |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | ZUP - Založba Univerze na Primorskem
|
|---|
| Opis: | A dominating set S ⊆ V is a co-secure dominating set if for each u ∈ S there exists v ∈ V \ S such that v is adjacent to u and (S \ {u}) ∪ {v} is a dominating set. The cardinality of a minimum co-secure dominating set in G is called the cosecure domination number of G and is denoted by γcs(G). The study of a co-secure dominating set is important in interconnection networks as it studies its security. In cosecure domination, a guard can ensure the safety of only one of its adjacent unguarded vertices. This motivated us to define a new domination parameter called complete co-secure domination, in which a guard can move to any one of its adjacent unguarded vertices without compromising the protection of G. A co-secure dominating set S is called a complete co-secure dominating set if for every u ∈ S and for every v ∈ V \ S that is adjacent to u, (S \ {u})∪ {v} is a dominating set. The cardinality of a minimum complete co-secure dominating set is called the complete co-secure domination number of G and is denoted by γccs(G). In this paper, we study the complete co-secure domination in graphs and determined the lower and upper bounds and have checked their sharpness. We have proved that for any positive integer m, there exists a graph whose co-secure domination number is m and complete co-secure domination number is b, where m ≤ b ≤ 2m. We characterize graphs G such that γcs(G) = γccs(G). We obtain a condition for which γcs(G) = γccs(G) = γs(G) for graphs with δ(G) ≥ 2, thus partially resolving a question posed in paper from Arumugam, Ebadi and Manrique from 2014. We also obtain the complete co-secure domination number of some families of graphs. |
|---|
| Ključne besede: | domination number, co-secure domination number, complete co-secure domination number |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Datum objave: | 08.12.2025 |
|---|
| Založnik: | Založba Univerze na Primorskem |
|---|
| Leto izida: | 2026 |
|---|
| Št. strani: | 16 str. |
|---|
| Številčenje: | Vol. 9, no. 1, [article no.] P1.09 |
|---|
| PID: | 20.500.12556/RUP-22824  |
|---|
| UDK: | 51 |
|---|
| eISSN: | 2590-9770 |
|---|
| DOI: | 10.26493/2590-9770.1815.df2 |
|---|
| Datum objave v RUP: | 20.03.2026 |
|---|
| Število ogledov: | 120 |
|---|
| Število prenosov: | 8 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
