| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651991 | Electronic Notes in Discrete Mathematics | 2014 | 5 Pages |
Abstract
The smallest number of edges that have to be deleted from a graph G to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by ϕ(G). In this paper our recent results on computing this quantity for hierarchical product of graphs are reported. We also present a fast algorithm for computing edge frustration index of (3, 6)–fullerene graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
