![](https://d3ilqtpdwi981i.cloudfront.net/Xa8nj1-vM3qdSx2BiD8Lt3D6vd4=/425x550/smart/https://bepress-attached-resources.s3.amazonaws.com/uploads/a2/f3/1b/a2f31b2f-bfb6-489a-b756-bbc14dcf51ec/thumbnail_b577e668-ebf4-4b08-9457-6c9098edf7fd.jpg)
Various measures that characterize graphs exist in literature. Insights into the properties of a graph as a whole and its components are revealed largely through graph measures, also called graph metrics. In seeking to interpret a consequential edge metric from a vertex-centric perspective, the paper advances an original measure – the relative isolation probability of a vertex. Concisely, the probability of relative isolation pertains to the likelihood of a vertex to be disconnected from all designated source vertices in a graph with probability-weighted edges. A two-step algorithm for efficient calculation is presented and evaluated. Contained within the procedure is a Monte Carlo simulation and the use of a compact data structure called the zero-suppressed binary decision diagram, efficiently constructed through the frontier-based search. The novel measure is then computed for a diverse set of graphs, serving as benchmark for the proposed method. In closing, case studies on real-world networks are performed to ensure the consistency of the experimental with the actual.