๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The bipartite edge frustration of hierarchical product of graphs

โœ Scribed by Yarahmadi, Zahra; Ashrafi, Ali Reza

Book ID
125468245
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
197 KB
Volume
45
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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,

Extremal properties of the bipartite ver
Extremal properties of the bipartite vertex frustration of graphs
โœ Zahra Yarahmadi; Ali Reza Ashrafi ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB

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 bipa