Fractional vertex cover reliability of graphs
From MaRDI portal
Publication:6625090
DOI10.61091/JCMCC122-13MaRDI QIDQ6625090
Derek W. Hein, Aysel Erey, Caitlynn Clawson, David Brown, Samuel Powell, Carter Green, Rudy Garcia
Publication date: 28 October 2024
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Cites Work
- The optimal unicyclic graphs for pair-connected reliability
- The vertex-cover polynomial of a graph
- Nonexistence of uniformly most reliable two-terminal graphs
- Classes of uniformly most reliable graphs for all-terminal reliability
- The number of independent sets in unicyclic graphs
- On uniformly most reliable two‐terminal graphs
- The node cop‐win reliability of unicyclic and bicyclic graphs
- Uniformly optimally reliable graphs: A survey
This page was built for publication: Fractional vertex cover reliability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6625090)