Super connectivity and super edge-connectivity of transformation graphs G +-+

For a graph G=(V(G), E(G)), the transformation graphs G(+-+) is the graph with vertex set V(G) boolean OR E(G) in which the vertices alpha and beta are joined by an edge if and only if alpha and beta are adjacent or incident in G while {alpha, beta} not subset of E(G), or alpha and beta are not adjacent in G while {alpha, beta} subset of E(G). In this note, we show that all but for a few exceptions, G(+-+) is super connected and super edge-connected.