The size of the smallest edge cut-set (cohesion) and the size of the smallest node cut-set (connectivity) have been used by some authors as vulnerability measures of a graph. Generalizations of the ...

This is a preview. Log in through your library . Abstract For integers l ≥ 1, d ≥ 0 we study (undirected) graphs with vertices 1,..., n such that the vertices can be partitioned into l parts such that ...

Graph labeling is a central topic in combinatorial optimisation that involves assigning numerical or categorical labels to vertices or edges of a graph subject to specific constraints. This framework ...