On uniformly most reliable complete multi-partite graphs

zbMATH Open1265.05340MaRDI QIDQ2918372FDOQ2918372

Authors: Zhihua Yu, Xiaodong Liang, Xiaohui Huang 

Publication date: 5 October 2012

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

Recommendations

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

zbMATH Keywords

network reliabilitycomplete multi-partite graphuniformly most reliable graphvertex failure

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40) Network design and communication in computer systems (68M10)

Cited In (7)

• A class of uniformly optimality complete multi-partite graphs
• Classes of uniformly most reliable graphs for all-terminal reliability
• Title not available (Why is that?)
• Counterexamples to conjectures for uniformly optimally reliable graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniformly optimally reliable graphs: A survey

This page was built for publication: On uniformly most reliable complete multi-partite graphs

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