On Zero Forcing Number of Permutation Graphs (Q3167349)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6101497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Zero Forcing Number of Permutation Graphs |
scientific article; zbMATH DE number 6101497 |
Statements
On Zero Forcing Number of Permutation Graphs (English)
0 references
2 November 2012
0 references
zero forcing set
0 references
zero forcing number
0 references
permutation graph
0 references
generalized prism
0 references
nearly complete graph
0 references
complete \(k\)-partite graph
0 references
cycle
0 references
path
0 references
0 references
0.94054735
0 references
0.93972933
0 references
0.9242618
0 references
0 references
0.9204582
0 references
0.9201096
0 references
0.91960424
0 references
0.9176913
0 references
