Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789)
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 7009751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nordhaus-Gaddum-type theorem for total-proper connection number of graphs |
scientific article; zbMATH DE number 7009751 |
Statements
Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (English)
0 references
31 January 2019
0 references
total-proper path
0 references
total-proper connection number
0 references
complementary graph
0 references
Nordhaus-Gaddum-type
0 references
0.8907651305198669
0 references
0.874451220035553
0 references
0.8491773009300232
0 references
0.8469982147216797
0 references
0.8229588270187378
0 references
