Optimal strong \((\kappa ,d)\)-orientation of complete \(k\)-partite graphs

DOI10.1016/J.DAM.2009.01.018zbMath1173.05018OpenAlexW2162577189MaRDI QIDQ1026132

Xiaofeng Guo, Huifang Miao

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.01.018

zbMATH Keywords

strong connectivitycomplete \(k\)-partite graphstrong diameterstrong distanceoptimal strong \((\kappa , d)\)-orientation

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

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

This page was built for publication: Optimal strong \((\kappa ,d)\)-orientation of complete \(k\)-partite graphs