Nordhaus-Gaddum-type theorem for total-proper connection number of graphs

DOI10.1007/s40840-017-0516-6zbMath1406.05034arXiv1611.08990OpenAlexW2963812438MaRDI QIDQ1712789

Jingshu Zhang, Xue Liang Li, Wen-Jing Li

Publication date: 31 January 2019

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.08990

zbMATH Keywords

complementary graphNordhaus-Gaddum-typetotal-proper connection numbertotal-proper path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Unnamed Item
• Proper connection of graphs
• Proper connection numbers of complementary graphs
• Nordhaus-Gaddum inequalities for domination in graphs
• Rainbow connections of graphs: a survey
• On the total proper connection of graphs
• On Complementary Graphs
• Rainbow connection in graphs
• The Diameter of a Graph and its Complement

This page was built for publication: Nordhaus-Gaddum-type theorem for total-proper connection number of graphs