Upper k-alliances in graphs

MaRDI QIDQ2898720zbMATH OpenFDO

Authors Jose M. Sigarreta

Publication date 11 July 2012

Published in International Journal of Contemporary Mathematical Sciences (Search for Journal in Brave)

Full work available at URL http://www.m-hikari.com/ijcms-2011/41-44-2011/index.html

zbMATH Keywords

graphalliancesupper defensive alliance

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial inequalities (05A20)

Recommendations

• Global defensive \(k\)-alliances in graphs
• Defensive k-alliances in graphs
• scientific article; zbMATH DE number 5056647
• scientific article; zbMATH DE number 6843424
• Partitioning a graph into defensive \(k\)-alliances

Cited in

(11)

• Saturated boundary \(k\)-alliances in graphs
• Computing the strong alliance polynomial of a graph
• k-STRONG DEFENSIVE ALLIANCES IN GRAPHS
• On the complement graph and defensive \(k\)-alliances
• Global defensive \(k\)-alliances in graphs
• Defensive k-alliances in graphs
• Alliances and Related Domination Parameters
• \gamma-TRANSITIVITY IN PLATONIC GRAPHS
• Alliances in graphs: parameters, properties and applications -- a survey
• Alliance free and alliance cover sets
• Alliance polynomial of regular graphs

This page was built for publication: Upper \(k\)-alliances in graphs

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