The bipartite edge frustration of composite graphs

The bipartite edge frustration of composite graphs

The smallest number of edges that have to be deleted from a graph to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by φ ( G ) . In this paper we determine the bipartite edge frustration of some classes of composite graphs.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics 2010-07, Vol.158 (14), p.1551-1558
Hauptverfasser: Yarahmadi, Z., Došlić, T., Ashrafi, A.R.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Bipartite edge frustration
Bipartite graph
Combinatorics
Combinatorics. Ordered structures
Composite graph
Computer science
control theory
systems
Exact sciences and technology
Frustration
Graphs
Information retrieval. Graph
Mathematical analysis
Mathematics
Sciences and techniques of general use
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The smallest number of edges that have to be deleted from a graph to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by φ ( G ) . In this paper we determine the bipartite edge frustration of some classes of composite graphs.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2010.04.010