Strong orientations of complete \(k\)-partite graphs achieving the strong diameter

DOI10.1016/J.IPL.2009.12.005zbMath1197.05042OpenAlexW2043807938MaRDI QIDQ991754

Huifang Miao, Guoping Lin

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.12.005

zbMATH Keywords

automatic theorem provingcomplete \(k\)-partite graphstrong diameterstrong distancelower and upper orientable strong diameter

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Strongly self-centered orientation of complete \(k\)-partite graphs

Cites Work

• Distance in digraphs
• On strong distances in oriented graphs
• Lower and upper orientable strong radius and strong diameter of complete \(k\)-partite graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong orientations of complete \(k\)-partite graphs achieving the strong diameter