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)

zbMATH Keywords

split reliabilitylocally most split reliable graphuniformly most split reliable graph

Mathematics Subject Classification ID

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

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)