Ponencia
On the vulnerability of some families of graphs
Autor/es | Moreno Casablanca, Rocío
Diánez Martínez, Ana Rosa García Vázquez, Pedro |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2010 |
Fecha de depósito | 2021-10-20 |
Publicado en |
|
ISBN/ISSN | 978-84-7653-565-3 |
Resumen | The toughness of a noncomplete graph G is defined as τ (G) =
min{|S|/ω(G − S)}, where the minimum is taken over all cutsets
S of vertices of G and ω(G − S) denotes the number of
components of the resultant graph G − S ... The toughness of a noncomplete graph G is defined as τ (G) = min{|S|/ω(G − S)}, where the minimum is taken over all cutsets S of vertices of G and ω(G − S) denotes the number of components of the resultant graph G − S by deletion of S. In this paper, we investigate the toughness of the corona of two connected graphs and obtain the exact value for the corona of two graphs belonging to some families as paths, cycles, wheels or complete graphs. We also get an upper and a lower bounds for the toughness of the cartesian product of the complete graph K2 with a predetermined graph G. |
Agencias financiadoras | Ministerio de Educación y Ciencia (MEC). España Junta de Andalucía |
Identificador del proyecto | MTM2008-06620-C03-02
P06-FQM-01649 |
Cita | Moreno Casablanca, R., Diánez Martínez, A.R. y García Vázquez, P. (2010). On the vulnerability of some families of graphs. En IWONT 2010: 3rd International Workshop on Optimal Networks Topologies (183-196), Barcelona, España: Iniciativa Digital Politècnica. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
On the vulnerability of some ... | 558.7Kb | [PDF] | Ver/ | |