Open AccessSuperconnectivity of networks modeled by the strong product of graphs
Author(s) -
Rocío Moreno Casablanca,
M. Cera,
P. García–Vázquez,
Juan Carlos Valenzuela
Publication year - 2015
Publication title -
applicable analysis and discrete mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.69
H-Index - 26
eISSN - 2406-100X
pISSN - 1452-8630
DOI - 10.2298/aadm150908017c
Subject(s) - mathematics , vertex (graph theory) , product (mathematics) , graph , combinatorics , reliability (semiconductor) , connectivity , discrete mathematics , geometry , power (physics) , physics , quantum mechanics
Maximal connectivity and superconnectivity in a network are two important features of its reliability. In this paper, using graph terminology, we first give a lower bound for the vertex connectivity of the strong product of two networks and then we prove that the resulting structure is more reliable than its generators. Namely, sufficient conditions for a strong product of two networks to be maximally connected and superconnected are given