On the doubly connected domination polynomial of a graph (Q4966673): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q130039736, #quickstatements; #temporary_batch_1724938403945 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s1793557119500360 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2797787604 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130039736 / rank | |||
Normal rank | |||
Latest revision as of 14:44, 29 August 2024
scientific article; zbMATH DE number 7074015
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
