Recall that a node

satisfies strong triadic closure if whenever

and

are strong $($for

$),$ there is an edge

that is at least weak $($and possibly strong$).$ An edge

is a local bridge if in the graph with the edge

removed, the shortest path from

to

has length at least $3.$