The shape of node reliability

DOI10.1016/j.dam.2017.11.035zbMath1383.05165arXiv1703.10573OpenAlexW2744937545MaRDI QIDQ1701111

L. A. S. Mól, Jason I. Brown

Publication date: 22 February 2018

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

Full work available at URL: https://arxiv.org/abs/1703.10573

zbMATH Keywords

coherencegraph theory\(S\)-shapedall-terminal reliabilitynode reliability

Mathematics Subject Classification ID

Graph polynomials (05C31)

Related Items (3)

Maximal intervals of decrease and inflection points for node reliability ⋮ Network reliability: Heading out on the highway ⋮ On the Mean Connected Induced Subgraph Order of Cographs

Cites Work

• Unnamed Item
• Unnamed Item
• The minimal number of subtrees of a tree
• The minimal number of subtrees with a given degree sequence
• Computing residual connectedness reliability for restricted networks
• Enumeration of subtrees of trees
• Binary trees with the largest number of subtrees
• Uniformly optimal graphs in some classes of graphs with node failures
• On subtrees of trees
• The traveling salesman problem in bounded degree graphs
• The Complexity of the Residual Node Connectedness Reliability Problem
• Multi-Component Systems and Structures and Their Reliability
• On reliability of graphs with node failures
• Reliability polynomials having arbitrarily many inflection points
• The Number of Subtrees of Trees with Given Degree Sequence

This page was built for publication: The shape of node reliability