Repositorio de producción científica de la Universidad de Sevilla

On average connectivity of the strong product of graphs

 

Advanced Search
 
Opened Access On average connectivity of the strong product of graphs
Cites

Show item statistics
Icon
Export to
Author: Abajo Casado, María Encarnación
Moreno Casablanca, Rocío
Diánez Martínez, Ana Rosa
García Vázquez, Pedro
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Date: 2013
Published in: Discrete Applied Mathematics, 161 (18), 2795-2801.
Document type: Article
Abstract: The average connectivity κ(G) of a graph G is the average, over all pairs of vertices, of the maximum number of internally disjoint paths connecting these vertices. The connectivity κ(G) can be seen as the minimum, over all pairs of vertices, of the maximum number of internally disjoint paths connecting these vertices. The connectivity and the average connectivity are upper bounded by the minimum degree δ(G) and the average degree d(G) of G, respectively. In this paper the average connectivity of the strong product G1 G2 of two connected graphs G1 and G2 is studied. A sharp lower bound for this parameter is obtained. As a consequence, we prove that κ(G1 G2) = d(G1 G2) if κ(Gi) = d(Gi), i = 1, 2. Also we deduce that κ(G1 G2) = δ(G1 G2) if κ(Gi) = δ(Gi), i = 1, 2.
Cite: Abajo Casado, M.E., Moreno Casablanca, R., Diánez Martínez, A.R. y García Vázquez, P. (2013). On average connectivity of the strong product of graphs. Discrete Applied Mathematics, 161 (18), 2795-2801.
Size: 510.3Kb
Format: PDF

URI: https://hdl.handle.net/11441/69459

DOI: 10.1016/j.dam.2013.06.005

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)