Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / author | |||
| Property / author: Wen-Jing Li / rank | |||
| Property / author | |||
| Property / author: Xue Liang Li / rank | |||
| Property / author | |||
| Property / author: Wen-Jing Li / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Xue Liang Li / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963812438 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1611.08990 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proper connection of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rainbow connection in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nordhaus-Gaddum inequalities for domination in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Diameter of a Graph and its Complement / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proper connection numbers of complementary graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the total proper connection of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rainbow connections of graphs: a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Complementary Graphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:46, 18 July 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
