𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal properties of the bipartite vertex frustration of graphs

✍ Scribed by Zahra Yarahmadi; Ali Reza Ashrafi

Book ID
104001186
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
242 KB
Volume
24
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

The smallest number of vertices that have to be deleted from a graph G to obtain a bipartite subgraph is called the bipartite vertex frustration of G and denoted by ψ(G). In this paper, some extremal properties of this graph invariant are presented. Moreover, we present an exact formula for the bipartite vertex frustration of the corona product of graphs.

πŸ“œ SIMILAR VOLUMES

Extremal bipartite subgraphs of cubic tr
Extremal bipartite subgraphs of cubic triangle-free graphs
✍ Glenn Hopkins; William Staton πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 275 KB

## Abstract A cubic triangle‐free graph has a bipartite subgraph with at least 4/5 of the original edges. Examples show that this is a best possible result.

The bipartite edge frustration of extens
The bipartite edge frustration of extension of splice and link graphs
✍ Zahra Yarahmadi πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 312 KB

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 we extend the splice and link for two graphs and determine their bipartite edge frustration. As an application,