Article
Superconnectivity of Networks Modeled by the Strong Product of Graphs
Author/s | Moreno Casablanca, Rocío
![]() ![]() ![]() ![]() ![]() ![]() ![]() Cera López, Martín ![]() ![]() ![]() ![]() ![]() ![]() García Vázquez, Pedro ![]() ![]() ![]() ![]() ![]() ![]() Valenzuela Tripodoro, Juan Carlos |
Department | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Publication Date | 2015 |
Deposit Date | 2018-01-29 |
Published in |
|
Abstract | 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 ... 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. |
Funding agencies | Ministerio de Economía y Competitividad (MINECO). España |
Project ID. | MTM2014-60127-P
![]() |
Citation | Moreno Casablanca, R., Cera López, M., García Vázquez, P. y Valenzuela Tripodoro, J.C. (2015). Superconnectivity of Networks Modeled by the Strong Product of Graphs. Applicable Analysis and Discrete Mathematics, 9 (2), 347-356. |
Files | Size | Format | View | Description |
---|---|---|---|---|
Superconnectivity.pdf | 154.8Kb | ![]() | View/ | |