Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Lakshmi Girish"'
Publikováno v:
Symmetry, Vol 16, Iss 7, p 781 (2024)
A set S⊆V is referred to as a k-fault-tolerant power-dominating set of a given graph G=(V,E) if the difference S∖F remains a power-dominating set of G for any F⊆S with |F|≤k, where k is an integer with 0≤k<|V|. The lowest cardinality of a k
Externí odkaz:
https://doaj.org/article/57f90fc9aaa24208873e71f3378b2fde
