dc.creator | Moreno Casablanca, Rocío | es |
dc.creator | Diánez Martínez, Ana Rosa | es |
dc.creator | García Vázquez, Pedro | es |
dc.date.accessioned | 2018-01-29T09:24:15Z | |
dc.date.available | 2018-01-29T09:24:15Z | |
dc.date.issued | 2011 | |
dc.identifier.citation | 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. | |
dc.identifier.issn | 0020-7160 | es |
dc.identifier.uri | https://hdl.handle.net/11441/69650 | |
dc.description.abstract | 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. | es |
dc.description.sponsorship | Ministerio de Educación y Ciencia MTM2008-06620-C03-02 | es |
dc.description.sponsorship | Generalitat de Cataluña 1298 SGR2009 | es |
dc.description.sponsorship | Junta de Andalucía P06-FQM-01649 | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Taylor and Francis | es |
dc.relation.ispartof | International Journal of Computer Mathematics, 88 (13), 2697-2706. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Connectivity | es |
dc.subject | Toughness | es |
dc.subject | Vulnerability | es |
dc.title | Toughness of the corona of two graphs | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) | es |
dc.relation.projectID | MTM2008-06620-C03-02 | es |
dc.relation.projectID | 1298 SGR2009 | es |
dc.relation.projectID | P06-FQM-01649 | es |
dc.relation.publisherversion | http://www.tandfonline.com/doi/abs/10.1080/00207160.2011.564277?journalCode=gcom20 | es |
dc.identifier.doi | 10.1080/00207160.2011.564277 | es |
dc.contributor.group | Universidad de Sevilla. FQM240: Invariantes en Teoria de Grafos y Optimizacion | es |
idus.format.extent | 10 | es |
dc.journaltitle | International Journal of Computer Mathematics | es |
dc.publication.volumen | 88 | es |
dc.publication.issue | 13 | es |
dc.publication.initialPage | 2697 | es |
dc.publication.endPage | 2706 | es |
dc.identifier.sisius | 20111047 | es |