A class of uniformly optimality complete multi-partite graphs

MaRDI QIDQ2924172zbMATH OpenFDO

Authors Tianlong Ma, Xiaodong Liang

Publication date 3 November 2014

Published in Journal of Xinjiang University. Natural Science (Search for Journal in Brave)

zbMATH Keywords

complete multi-partite graphnetwork reliabilityuniformly optimal graph

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Combinatorial aspects of tessellation and tiling problems (05B45) Graph theory (05C99)

Recommendations

• Uniformly optimal graphs in some classes of graphs with node failures
• On uniformly most reliable complete multi-partite graphs
• On uniformly optimally reliable graphs for pair‐connected reliability with vertex failures
• scientific article; zbMATH DE number 434697
• scientific article; zbMATH DE number 1444280

Cited in

(7)

• Maximally connected \(p\)-partite uniform hypergraphs
• On uniformly most reliable complete multi-partite graphs
• scientific article; zbMATH DE number 844141 (Why is no real title available?)
• Ultrametrics and Complete Multipartite Graphs
• A Characterization of Undirected Graphs Admitting Optimal Cost Shares
• On uniformly optimally reliable graphs for pair‐connected reliability with vertex failures
• An optimization approach to the Langberg-Médard multiple unicast conjecture

This page was built for publication: A class of uniformly optimality complete multi-partite graphs

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