On the \(k\)-hop domination numbers of spanning trees of unicyclic graphs (Q5018959)
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 7450746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(k\)-hop domination numbers of spanning trees of unicyclic graphs |
scientific article; zbMATH DE number 7450746 |
Statements
27 December 2021
0 references
\(k\)-hop domination number
0 references
\(k\)-hop dominating set
0 references
unicyclic graph
0 references
spanning tree
0 references
graph algorithms
0 references
0 references
0 references
0.7628725171089172
0 references
0.7477021217346191
0 references
0.7449965476989746
0 references
0.7339561581611633
0 references
0.7230105996131897
0 references
