On the semitotal forcing number of a graph (Q2134991)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the semitotal forcing number of a graph |
scientific article; zbMATH DE number 7517477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the semitotal forcing number of a graph |
scientific article; zbMATH DE number 7517477 |
Statements
On the semitotal forcing number of a graph (English)
0 references
4 May 2022
0 references
semitotal forcing
0 references
semitotal forcing set
0 references
cubic graph
0 references
Petersen graph
0 references
0 references
0.8473654985427856
0 references
0.8391256332397461
0 references
0.8318575620651245
0 references
0.8225716948509216
0 references
0.8210696578025818
0 references
