On the bipartite vertex frustration of graphs
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...
| Autor: | |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versión aceptada para publicación |
| Data de publicação: | 2016 |
| País: | España |
| Recursos: | Universidad de Sevilla (US) |
| Repositório: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/154757 |
| Acesso em linha: | https://hdl.handle.net/11441/154757 https://doi.org/10.1016/j.endm.2016.09.050 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Bipartite vertex frustration Bipartite edge frustration Line graph Hamiltonian graph Tree |
| Resumo: | 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 |
|---|