Oct 11, 2023 · This paper introduces the notion of liar's vertex-edge domination which arises naturally from some applications in communication networks. Given ...
Algorithmic study on liar's vertex-edge domination problem - SpringerLink
link.springer.com › article
Oct 11, 2024 · This paper introduces the notion of liar's vertex-edge domination which arises naturally from some applications in communication networks. Given ...
Jan 24, 2024 · A subset of D ⊆ V is called liar's dominating set if |NG[vi]∩. D| ≥ 2, for every vi ∈ V and |(NG[vi] ∪ NG[vj]) ∩ D| ≥ 3 for every pair of ...
In this paper, we study this problem from an algorithmic point of view. We show that MinLVEDP can be solved in linear time for trees, whereas the decision ...
Oct 11, 2024 · This paper introduces the notion of liar's vertex-edge domination which arises naturally from some applications in communication networks. Given ...
Oct 22, 2024 · This paper introduces the notion of liar's vertex-edge domination which arises naturally from some applications in communication networks. Given ...
Journal: Journal of Combinatorial Optimization, 2024, № 3 ; Publisher: Springer Science and Business Media LLC ; Authors: Debojyoti Bhattacharya, Subhabrata Paul.
In this paper, we determine liar's domination and connected liar's domination for triangular snake graphs, double triangular snake graphs, Sierpiński triangle ...
In this paper, we first strengthen the complexity result of the liar's domination problem by showing that this problem remains NP-complete for split graphs and ...
Apr 10, 2018 · In this paper we have proposed a approximation algorithm for computing a minimum cardinality connected liar's dominating set of a general graph.