Most reliable graphs with reduced corank

DOI10.1016/J.DAM.2025.10.057MaRDI QIDQ6885527zbMATH OpenFDO

Authors Pablo Romero

Publication date 11 December 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.10.057

zbMATH Keywords

corankspanning treesuniformly most reliable graphs

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites work

• A new planarity test
• A proof of Boesch's conjecture
• Cubic graphs on \(\leq 14\) vertices
• Extremal graphs for the Tutte polynomial
• scientific article; zbMATH DE number 3049182 (Why is no real title available?)
• Nonexistence of optimal graphs for all terminal reliability
• Nonexistence of uniformly most reliable graphs of least corank
• On graphs with randomly deleted edges
• On maximum graphs in Tutte polynomial posets
• On the existence of uniformly optimally reliable networks
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Reliable circuits using less reliable relays
• Some conjectured uniformly optimal reliable networks
• The structure of max ?-minm?+1 graphs used in the design of reliable networks
• There are finitely many uniformly most reliable graphs of corank 5
• Uniformly optimally reliable graphs: A survey
• Uniformly-most reliable networks do not always exist

This page was built for publication: Most reliable graphs with reduced corank

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