By providing the genuinely new „networked“ understanding of exile, this study aims to rewrite significantly the story of Czechoslovak political emigration and re-assess its functioning mostly by means of a tool so far ignored in this field: The Social Network Analysis. According to the dominant historiographical narrative, the Czechoslovak exile followed mostly political goals and was structured as an hierarchy with the Council of Free Czechoslovakia being the supreme body initially respected by most (though not by all) fractions within the exile movement across the globe. That is why the historical research, rather one-sidedly, focused upon the institutional history, biographies of political leaders and ideological debate within political parties in exile. The study argues that the traditional approach needs a substantial revision. Though initially designed as a state-like hierarchy with pyramidal decision-making procedures (with coordinating power vested in the Council of Free Czechoslovakia) the exile soon transformed itself into a horizontal and rather informal network of loosely interconnected and mutually collaborating units and individuals across the globe. The „network thesis“ is demonstrated upon the model analysis of František Váňa’s and Přemysl Pitter’s communication webs being part of the long-term research of Czechoslovak exile networks, 1948–1989.
A network begnis losing nodes or liriks, or there inay be a loss in its
effectiveness. Thus, the communication network must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible reconstruction of the network. Stability numbers of a communication network measure its durability with respect to a break down. If we consider a graph as modelling of a communication network, connectivity is an important measure of reliability or stability of a graph, but not enough. Integrity is a new measurement of stability. It takes into consideration the number of vertices of the remaining cornponents after some disruption. Also the edge-integrity is defined. In this paper, we study integrity (or vertex-integrity) and edge-integrity of Double Star Graphs and some of its cornpounds.