Global defensive k-alliances in directed graphs: combinatorial and computational issues

DOI10.1051/RO/2019049zbMATH Open1462.05160OpenAlexW2943519940MaRDI QIDQ3389344

Doost Ali Mojdeh, Ismael González Yero, Babak Samadi

Publication date: 10 May 2021

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2019049

zbMATH Keywords

dominating setrooted treedirected tree\(k\)-order-sum numberglobal defensive \(k\)-alliance number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On global defensive k-alliances in zero-divisor graphs of finite commutative rings ⋮ Boundary defensive \(k\)-alliances in graphs

This page was built for publication: Global defensive k-alliances in directed graphs: combinatorial and computational issues