Global offensive k-alliance in bipartite graphs

DOI10.7494/OPMATH.2012.32.1.83MaRDI QIDQ2901935zbMATH OpenOpenAlexFDO

Authors Mustapha Chellali, Lutz Volkmann

Publication date 31 July 2012

Published in Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7494/opmath.2012.32.1.83

zbMATH Keywords

treesbipartite graphsglobal offensive \(k\)-alliance number

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 5777940
• Bounds on the global offensive \(k\)-alliance number in graphs
• Connected global offensive \(k\)-alliances in graphs
• Independence and global offensive alliance in graphs
• On global offensive \(k\)-alliances in graphs

Cited in

(8)

• Partitioning a graph into offensive k-alliances
• scientific article; zbMATH DE number 5777940 (Why is no real title available?)
• Connected global offensive \(k\)-alliances in graphs
• Independence and global offensive alliance in graphs
• On global offensive \(k\)-alliances in graphs
• Alliances and Related Domination Parameters
• Alliances in graphs: parameters, properties and applications -- a survey
• Bounds on the global offensive \(k\)-alliance number in graphs

This page was built for publication: Global offensive \(k\)-alliance in bipartite graphs

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