| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423741 | Electronic Notes in Discrete Mathematics | 2016 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
P. GarcÃa-Vázquez,