Mostrar el registro sencillo del ítem
Artículo
On the bipartite vertex frustration of graphs
dc.creator | García Vázquez, Pedro | es |
dc.date.accessioned | 2024-02-07T07:03:30Z | |
dc.date.available | 2024-02-07T07:03:30Z | |
dc.date.issued | 2016-10 | |
dc.identifier.citation | García Vázquez, P. (2016). On the bipartite vertex frustration of graphs. Electronic Notes in Discrete Mathematics, 54, 289-294. https://doi.org/10.1016/j.endm.2016.09.050. | |
dc.identifier.issn | 1571-0653 | es |
dc.identifier.uri | https://hdl.handle.net/11441/154757 | |
dc.description.abstract | The bipartite vertex (resp. edge) frustration of a graph G, denoted by ψ(G) (resp. φ(G)), is the smallest number of vertices (resp. edges) that have to be deleted from G to obtain a bipartite subgraph of G. A sharp lower bound of the bipartite vertex frustration of the line graph L(G) of every graph G is given. In addition, the exact value of ψ(L(G)) is calculated when G is a forest | es |
dc.format | application/pdf | es |
dc.format.extent | 7 p. | es |
dc.language.iso | eng | es |
dc.publisher | Elsevier | es |
dc.relation.ispartof | Electronic Notes in Discrete Mathematics, 54, 289-294. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Bipartite vertex frustration | es |
dc.subject | Bipartite edge frustration | es |
dc.subject | Line graph | es |
dc.subject | Hamiltonian graph | es |
dc.subject | Tree | es |
dc.title | On the bipartite vertex frustration of graphs | es |
dc.type | info:eu-repo/semantics/article | es |
dc.type.version | info:eu-repo/semantics/acceptedVersion | 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 | MTM2014-60127-P | es |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S1571065316301445?via%3Dihub | es |
dc.identifier.doi | 10.1016/j.endm.2016.09.050 | es |
dc.contributor.group | Universidad de Sevilla. FQM240: Invariantes en Teoría de Grafos y Optimización | es |
dc.journaltitle | Electronic Notes in Discrete Mathematics | es |
dc.publication.volumen | 54 | es |
dc.publication.initialPage | 289 | es |
dc.publication.endPage | 294 | es |
dc.contributor.funder | Ministerio de Economía y Competitividad (MINECO). España | es |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
On the bipartite vertex frustration ... | 324.0Kb | [PDF] | Ver/ | Versión aceptada |