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)

zbMATH Keywords

spanning treescorankuniformly most reliable graphs

Mathematics Subject Classification ID

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

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)