Artículo
Toughness of the corona of two 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 | 2011 |
Fecha de depósito | 2018-01-29 |
Publicado en |
|
Resumen | The toughness of a non-complete graph G = (V , E) 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 ... The toughness of a non-complete graph G = (V , E) 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. The corona of two graphs G and H , written as G ◦ H , is the graph obtained by taking one copy of G and |V (G)| copies of H , and then joining the ith vertex of G to every vertex in the ith copy of H . In this paper, we investigate the toughness of this kind of graphs and obtain the exact value for the corona of two graphs belonging to some families as paths, cycles, stars, wheels or complete graphs. |
Identificador del proyecto | MTM2008-06620-C03-02
1298 SGR2009 P06-FQM-01649 |
Cita | Moreno Casablanca, R., Diánez Martínez, A.R. y García Vázquez, P. (2011). Toughness of the corona of two graphs. International Journal of Computer Mathematics, 88 (13), 2697-2706. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Toughness.pdf | 166.7Kb | [PDF] | Ver/ | |