Upper bounds on the \(k\)-forcing number of a graph (Q479006): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6377035 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
zero forcing set | |||
Property / zbMATH Keywords: zero forcing set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
zero forcing number | |||
Property / zbMATH Keywords: zero forcing number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(k\)-forcing | |||
Property / zbMATH Keywords: \(k\)-forcing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(k\)-forcing number | |||
Property / zbMATH Keywords: \(k\)-forcing number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
connected dominating sets | |||
Property / zbMATH Keywords: connected dominating sets / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
connected domination number | |||
Property / zbMATH Keywords: connected domination number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(k\)-independence number | |||
Property / zbMATH Keywords: \(k\)-independence number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
rank | |||
Property / zbMATH Keywords: rank / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nullity | |||
Property / zbMATH Keywords: nullity / rank | |||
Normal rank |
Revision as of 18:45, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Upper bounds on the \(k\)-forcing number of a graph |
scientific article |
Statements
Upper bounds on the \(k\)-forcing number of a graph (English)
0 references
5 December 2014
0 references
zero forcing set
0 references
zero forcing number
0 references
\(k\)-forcing
0 references
\(k\)-forcing number
0 references
connected dominating sets
0 references
connected domination number
0 references
\(k\)-independence number
0 references
rank
0 references
nullity
0 references