On the doubly connected domination polynomial of a graph (Q4966673)
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 doubly connected domination polynomial of a graph |
scientific article; zbMATH DE number 7074015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the doubly connected domination polynomial of a graph |
scientific article; zbMATH DE number 7074015 |
Statements
On the doubly connected domination polynomial of a graph (English)
0 references
27 June 2019
0 references
domination polynomial
0 references
doubly connected set
0 references
friendship graph
0 references
cactus chain graph
0 references
0.901746153831482
0 references
0.8434853553771973
0 references
0.84330153465271
0 references
0.8428855538368225
0 references
0.8394384980201721
0 references
