k-STRONG DEFENSIVE ALLIANCES IN GRAPHS

DOI10.56827/SEAJMMS.2023.1901.16MaRDI QIDQ6149003zbMATH OpenFDO

Authors Chandru Hegde, B. Sooryanarayana

Publication date 12 January 2024

Published in South East Asian J. of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.56827/SEAJMMS.2023.1901.16

zbMATH Keywords

alliancesdefensive alliance numberstrong defensive alliances

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Strong alliances in graphs
• Global defensive \(k\)-alliances in graphs
• scientific article; zbMATH DE number 6843424
• Upper k-alliances in graphs
• Defensive k-alliances in graphs

Cites work

• A survey on alliances and related parameters in graphs
• Alliances and Related Domination Parameters
• Defensive k-alliances in graphs
• Double Roman domination number of middle graph
• Downhill and uphill domination in graphs
• Global defensive alliances in graphs
• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• Offensive alliances in graphs
• Open alliance in graphs
• Powerful alliances in graphs
• Strong alliances in graphs

This page was built for publication: k-STRONG DEFENSIVE ALLIANCES IN GRAPHS

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