Two measures for the stability of extended Fibonacci Cubes

The Fibonacci Cube is an interconnection network that gets many desirable properties that are very important in the network design, network stability and applications. The extended Fibonacci Cube is a new network topology. The vulnerability value of a communication network shows the resistance of the network after the disruption of some centres or connection lines until the communication breakdown. In a network, as the number of centres belonging to sub networks changes, the vulnerability of the network also changes and requires greater degrees of stability or less vulnerability. If the communication network is modelled by graph G, the deterministic measures tend to provide a worst-case analysis of some aspects of overall disconnection process. Many graph theoretical parameters have been used in the past to describe the stability of communication networks. There are few parameters such as integrity, neighbour-integrity and tenacity number giving the vulnerability. Also, in the neighbour-integrity, if a station is destroyed, the adjacent stations will be betrayed so that the betrayed stations become useless to network as a whole. In this paper we study the stability of the Extended Fibonacci Cube using the integrity and neighbour-integrity. We compared the obtained results with the results of the other network topologies. We saw that, for two graphs G 1 and G2 that have same number of vertices if k(G 1) > k(G2), then I(G1) > I(G2) and NI(G1 < NI(G2). © ICS AS CR 2006