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

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(...

Full description

Bibliographic Details
Main Authors: Baskar Nivedha, Mangam Tabitha Agnes, Acharya Mukti
Format: Article
Language:English
Published: Sciendo 2023-08-01
Series:Acta Universitatis Sapientiae: Informatica
Subjects:
Online Access:https://doi.org/10.2478/ausi-2023-0012