A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 15A03 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6034502 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
zero forcing number | |||
| Property / zbMATH Keywords: zero forcing number / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
zero spread | |||
| Property / zbMATH Keywords: zero spread / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum nullity | |||
| Property / zbMATH Keywords: maximum nullity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cut-vertex reduction | |||
| Property / zbMATH Keywords: cut-vertex reduction / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
unicyclic graphs | |||
| Property / zbMATH Keywords: unicyclic graphs / rank | |||
Normal rank | |||
Revision as of 20:56, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A technique for computing the zero forcing number of a graph with a cut-vertex |
scientific article |
Statements
A technique for computing the zero forcing number of a graph with a cut-vertex (English)
0 references
14 May 2012
0 references
zero forcing number
0 references
zero spread
0 references
maximum nullity
0 references
cut-vertex reduction
0 references
unicyclic graphs
0 references
