Partitioning a graph into defensive \(k\)-alliances (Q546272): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5912870 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
defensive alliances | |||
Property / zbMATH Keywords: defensive alliances / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
dominating sets | |||
Property / zbMATH Keywords: dominating sets / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
domination | |||
Property / zbMATH Keywords: domination / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
isoperimetric number | |||
Property / zbMATH Keywords: isoperimetric number / rank | |||
Normal rank |
Revision as of 11:31, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Partitioning a graph into defensive \(k\)-alliances |
scientific article |
Statements
Partitioning a graph into defensive \(k\)-alliances (English)
0 references
24 June 2011
0 references
defensive alliances
0 references
dominating sets
0 references
domination
0 references
isoperimetric number
0 references