We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree tc(g) associated with any 2-connected graph g, whose white vertices are the 3-components of g (3-connected components or polygons) and black vertices are bonds a...

The analysis of vulnerability in networks generally involves some questions about how the underlying graph is connected. One is naturally interested in studying the types of disruption in the network that maybe caused by failures of certain links or nodes. In terms of a graph, the concept of connectedness is used in dierent forms to study many of the measures of vulnerability. When certain vert...

Abstract We prove that the invariably generating graph of a finite group can have an arbitrarily large number connected components with at least two vertices.

An MI-group is an algebraic structure based on a generalization of the concept of a monoid that satisfies the cancellation laws and is endowed with an invertible anti-automorphism representing inversion. In this paper, a topology is defined on an MI-group $G$ under which $G$ is  a topological MI-group. Then we will identify open, discrete and compact MI-subgroups. The connected components of th...