Abstract
The all-terminal reliability and K-terminal reliability of networks are often considered as separate problems. We use the partition lattice of the vertex set of an undirected graph to show that these reliability measures are closely related. As an application of the presented approach, a formula for the K-terminal reliability polynomial of the complete graph and Buzacott's node partition formula are derived.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
