Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264)
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 6832362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs |
scientific article; zbMATH DE number 6832362 |
Statements
Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (English)
0 references
30 January 2018
0 references
total-rainbow path
0 references
total-rainbow connection number
0 references
complementary graph
0 references
Nordhaus-Gaddum-type upper bound
0 references
0.9184779524803162
0 references
0.9184779524803162
0 references
0.9048545360565186
0 references
0.880361020565033
0 references
0.8687300682067871
0 references
