On the construction of locally most reliable two-terminal graphs

DOI10.1016/j.dam.2024.06.021zbMATH Open1544.05052MaRDI QIDQ6585276

Shi-Cai Gong, Lu Lin

Publication date: 9 August 2024

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

zbMATH Keywords

graph polynomialreliability polynomialtwo-terminal graph\(k\)-terminal graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Two path extremal graphs and an application to a Ramsey-type problem
• Threshold graphs and related topics
• Nonexistence of uniformly most reliable two-terminal graphs
• Classes of uniformly most reliable graphs for all-terminal reliability
• Rearrangements of \((0,-1)\) matrices
• Sum of squares of degrees in a graph
• On graphs with randomly deleted edges
• A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
• Graphs with maximal number of adjacent pairs of edges
• A proof of Boesch's conjecture
• Nonexistence of optimal graphs for all terminal reliability
• On uniformly most reliable two‐terminal graphs
• On the Number of All Substructures Containing at Most Four Edges
• On the existence of uniformly optimally reliable networks
• Uniformly optimally reliable graphs: A survey

This page was built for publication: On the construction of locally most reliable two-terminal graphs

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