A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture (Q400496)
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: A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture |
scientific article; zbMATH DE number 6333602
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture |
scientific article; zbMATH DE number 6333602 |
Statements
A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture (English)
0 references
22 August 2014
0 references
total domination number
0 references
distance
0 references
eccentricity
0 references
periphery
0 references
0.9301285
0 references
0.92141706
0 references
0.91416264
0 references
0.90627366
0 references
