On connectivity of the semi-splitting block graph of a graph

Abstract

Abstract A graph G is said to be a semi-splitting block graph if there exists a graph H such that SB(H) ≌ G. This paper establishes a characterisation of semi-splitting block graphs based on the partition of the vertex set of G. The vertex (edge) connectivity and p-connectedness (p-edge connectedness) of SB(G) are examined. For all integers a, b with 1 < a < b, the existence of the graph G for which κ (G) = a, κ (SB(G)) = b and λ (G) = a, λ (SB(G)) = b are proved independently. The characterization of graphs with κ(SB(G)) = κ (G) and a necessary condition for graphs with κ (SB(G)) = λ (SB(G)) are achieved.