Uniformly optimal graphs in some classes of graphs with node failures

DOI10.1016/j.disc.2009.08.006zbMath1189.05167OpenAlexW2098039473MaRDI QIDQ1045157

Fang-Ming Shao, Huajun Meng, Shimin Yu

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.08.006

zbMATH Keywords

network reliabilitymultipartite graphnode failuresuniformly optimal graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (7)

Sixty years of network reliability ⋮ Maximal intervals of decrease and inflection points for node reliability ⋮ The node cop‐win reliability of unicyclic and bicyclic graphs ⋮ Uniformly optimally reliable graphs: A survey ⋮ <scp>M</scp>ost reliable two‐terminal graphs with node failures ⋮ The shape of node reliability ⋮ On the Mean Connected Induced Subgraph Order of Cographs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• Uniformly-most reliable networks do not always exist
• On reliability of graphs with node failures
• Uniformly optimally reliable graphs
• On the Invulnerability of the Regular Complete k-Partite Graphs

This page was built for publication: Uniformly optimal graphs in some classes of graphs with node failures