Article
On the bipartite vertex frustration of graphs
Author/s | García Vázquez, Pedro |
Department | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Publication Date | 2016-10 |
Deposit Date | 2024-02-07 |
Published in |
|
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 ... 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 |
Funding agencies | Ministerio de Economía y Competitividad (MINECO). España |
Project ID. | MTM2014-60127-P |
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. |
Files | Size | Format | View | Description |
---|---|---|---|---|
On the bipartite vertex frustration ... | 324.0Kb | [PDF] | View/ | Versión aceptada |