Strongly self-centered orientation of complete k-partite graphs

DOI10.1016/J.DAM.2014.05.026zbMATH Open1298.05266OpenAlexW2045301964MaRDI QIDQ401152FDOQ401152

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

Recommendations

• scientific article; zbMATH DE number 6107225
• scientific article; zbMATH DE number 1848408
• scientific article; zbMATH DE number 1439402
• Optimal strong \((\kappa ,d)\)-orientation of complete \(k\)-partite graphs
• scientific article

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Well-balanced orientations of mixed graphs
• Strong orientations of complete \(k\)-partite graphs achieving the strong diameter

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Self-converse and oriented graphs among the third parts of nearly complete digraphs
• Title not available (Why is that?)
• A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401152)