Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s40840-017-0516-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S40840-017-0516-6 / rank | |||
Normal rank | |||
Latest revision as of 05:35, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nordhaus-Gaddum-type theorem for total-proper connection number of graphs |
scientific article |
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
