On \(\mathcal{F}\)-domination in graphs (Q5154559)
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 7406334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(\mathcal{F}\)-domination in graphs |
scientific article; zbMATH DE number 7406334 |
Statements
On -domination in graphs (English)
0 references
5 October 2021
0 references
domination
0 references
\(\mathcal{F}\)-domination
0 references
\(\mathcal{F}\)-domination number
0 references
\(\mathcal{F}\)-irredundance
0 references
0.8485568165779114
0 references
0.845055341720581
0 references
0.8331851363182068
0 references
0.8209030628204346
0 references
0.8091381788253784
0 references
