Índice de separación en triangulaciones de esferas de dos dimensiones.

Abstract

ABSTRACT: We study a new combinatorial invariant, separation index. It pretends to size how much connected or not is a graph. Even if it can be define for any graph, on Burton et al. article and on this paper we study it only on 2-sphere triangulations. On section 3 we explain some necessary graph theory results for undertand the rest of the paper. Then on the section 4 we study the separation index, proving the most important results on the article of Burton et al. but also, we include new and original results like Lemma 4.14 and Theorem 4.15. On the following sections, we do an experimental study with the algorithmics implementations on Sage.