On uniformly most reliable complete multi-partite graphs

MaRDI QIDQ2918372zbMATH OpenFDO

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)

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)

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

Cited in

(7)

• Classes of uniformly most reliable graphs for all-terminal reliability
• scientific article; zbMATH DE number 434697 (Why is no real title available?)
• scientific article; zbMATH DE number 844141 (Why is no real title available?)
• Uniformly optimally reliable graphs: A survey
• Counterexamples to conjectures for uniformly optimally reliable graphs.
• scientific article; zbMATH DE number 2140713 (Why is no real title available?)
• A class of uniformly optimality complete multi-partite graphs

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)