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

DOI10.1051/RO/2019049MaRDI QIDQ3389344zbMATH OpenOpenAlexFDO

Authors Doost Ali Mojdeh, B. Samadi, Ismael G. Yero

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

\(k\)-order-sum numberdirected treedominating setglobal defensive \(k\)-alliance numberrooted tree

Mathematics Subject Classification ID

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

Recommendations

• Global defensive \(k\)-alliances in graphs
• Defensive k-alliances in graphs
• Distribution of global defensive \(k\)-alliances over some graph products
• On global offensive \(k\)-alliances in graphs
• scientific article; zbMATH DE number 6843424
• On the defensive alliances in graph
• Global defensive alliances in the join, corona and composition of graphs.
• On the complement graph and defensive \(k\)-alliances
• Boundary defensive k-alliances in graphs
• Defensive alliances in graphs of bounded treewidth

Cited in

(3)

• On global defensive k-alliances in zero-divisor graphs of finite commutative rings
• Defensive alliances in signed networks
• Boundary defensive k-alliances in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389344)