On the structure of arbitrarily partitionable graphs with given connectivity
Lists
Only you see this
Abstract
A graph G=(V,E)<math><mi is="true">G</mi><mo is="true">=</mo><mrow is="true"><mo is="true">(</mo><mi is="true">V</mi><mo is="true">,</mo><mi is="true">E</mi><mo is="true">)</mo></mrow></math> is arbitrarily partitionable if for any sequence τ<math><mi is="true">τ</mi></math> of positive integers adding up to |V|<math><mrow is="true"><mo is="true">|</mo><mi is="true">V</mi><mo is="true">|</mo></mrow></math>, there is a sequence of vertex-disjoint subsets of V<math><mi is="true">V</mi></math> whose orders are given by τ<math><mi is="true">τ</mi></math>, and which induce connected subgraphs. Such a graph models, e.g., a computer network which may be arbitrarily partitioned into connected subnetworks. In this paper we study the structure of such graphs and prove that unlike in some related problems, arbitrarily partitionable graphs may have arbitrarily many components after removing a cutset of a given size ≥2<math><mo is="true">≥</mo><mn is="true">2</mn></math>. The sizes of these components grow exponentially, though.
BibTeX
@article{baudon2014structure,
author = {Olivier Baudon and Florent Foucaud and Jakub Przybylo and Mariusz Wozniak},
title = {{On the structure of arbitrarily partitionable graphs with given connectivity}},
journal = {Discret. Appl. Math.},
year = {2014},
doi = {10.1016/j.dam.2013.09.007},
}Loading related content...