Superconnectivity of networks modeled by the strong product of graphs-Reference-Cited by-同舟云学术

Superconnectivity of networks modeled by the strong product of graphs

Published:2015 Issue:2 Volume:9 Page:347-356
ISSN:1452-8630
Container-title:Applicable Analysis and Discrete Mathematics
language:en
Short-container-title:APPL ANAL DISCRETE M

Author:

Casablanca R.M.¹,Cera M.²,García-Vázquez P.³,Valenzuela J.C.⁴

Affiliation:

1. Departamento de Matemática Aplicada I, Universidad de Sevilla, E.T.S. de Arquitectura, Sevilla, Spain

2. Universidad de Sevilla, Departamento de Matemtica Aplicada I, E.T.S. de Ingeniería Agronómica, Sevilla, Spain

3. Universidad de Sevilla, Departamento de Matemática Aplicada I, E.T.S. de Arquitectura, Sevilla, Spain

4. Universidad de Cádiz, Departamento de Matemáticas, E.P.S. de Algeciras, Algeciras, Spain

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 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

Publisher

National Library of Serbia

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extra connectivity of networks modeled by the strong product graphs;Applied Mathematics and Computation;2024-09

2. On the information transmission delay and algorithms of strong product digraphs;2023 9th International Conference on Computer and Communications (ICCC);2023-12-08

3. Separation of Cartesian products of graphs into several connected components by the removal of edges;Applicable Analysis and Discrete Mathematics;2021