Superconnectivity of networks modeled by the strong product of graphs

Applicable Analysis and Discrete Mathematics

article

Rocio M Casablanca¹  Martin Cera¹  Pedro García-Vázquez¹  Juan Carlos Valenzuela Tripodoro² 

[1] Departamento de Matem´atica Aplicada I, Universidad de Sevilla;Departamento de Matem´aticas, Universidad de C´adiz

关键词: Networks reliability;    connectivity;    strong product graphs;    maximally connected graphs;    superconnected graphs.;   

DOI  :  10.2298/AADM150908017C

学科分类：社会科学、人文和艺术（综合）

来源: Univerzitet u Beogradu * Elektrotehnicki Fakultet / University of Belgrade, Faculty of Electrical Engineering

【 摘 要 】

Maximal connectivity and superconnectivity in a network are two importantfeatures of its reliability. In this paper, using graph terminology, we firstgive a lower bound for the vertex connectivity of the strong product of twonetworks and then we prove that the resulting structure is more reliablethan its generators. Namely, sufficient conditions for a strong product of twonetworks to be maximally connected and superconnected are given.

【 授权许可】

Unknown