Characterization of locally most split reliable graphs

DOI10.1016/J.TCS.2025.115327MaRDI QIDQ6969926zbMATH OpenFDO

Authors Pablo Romero

Publication date 19 June 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115327

zbMATH Keywords

locally most split reliable graphsplit reliabilityuniformly most split reliable graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites work

• Extremal graphs for the Tutte polynomial
• scientific article; zbMATH DE number 913349 (Why is no real title available?)
• Nonexistence of uniformly most reliable two-terminal graphs
• On maximum graphs in Tutte polynomial posets
• On the construction of locally most reliable two-terminal graphs
• On the roots of all-terminal reliability polynomials
• On the split reliability of graphs
• On uniformly most reliable two-terminal graphs
• Reliable circuits using less reliable relays
• Roots of the Reliability Polynomials
• The Brown-Colbourn conjecture on zeros of reliability polynomials is false
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Undirected simple connected graphs with minimum number of spanning trees
• Uniformly optimally reliable graphs: A survey

This page was built for publication: Characterization of locally most split reliable graphs

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