Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement

DOI10.1007/s10114-012-0727-6zbMath1259.05093OpenAlexW2139649329MaRDI QIDQ1941298

Johannes H. Hattingh, Terry J. Walters, Ossama A. Saleh, Lucas C. Van Der Merwe

Publication date: 12 March 2013

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-012-0727-6

zbMATH Keywords

induced path numberNordhaus-Gaddum

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates

Cites Work

• On Complementary Graphs
• Domination-balanced graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement