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

DOI10.1016/j.dam.2014.05.026zbMath1298.05266OpenAlexW2045301964MaRDI QIDQ401152

Weihua Yang, Huifang Miao

Publication date: 26 August 2014

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

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

zbMATH Keywords

complete \(k\)-partite graphstrong diameterstrong distancestrongly self-centered

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency

Cites Work

• Unnamed Item
• Unnamed Item
• Well-balanced orientations of mixed graphs
• Strong orientations of complete \(k\)-partite graphs achieving the strong diameter
• A generalization of Sperner's theorem and an application to graph orientations
• On strong distances in oriented graphs
• Acyclic orientations of complete bipartite graphs
• Lower and upper orientable strong radius and strong diameter of complete \(k\)-partite graphs
• On graphs containing a given graph as center

This page was built for publication: Strongly self-centered orientation of complete \(k\)-partite graphs