journal article
oaidoi:10.1016/j.dam.2010.04.010

The bipartite edge frustration of composite graphs

Authors
Publication date
28 July 2010
Publisher
Elsevier B.V.
Doi

    Abstract

    AbstractThe 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

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1016/j.dam.2010.04.010
    Last time updated on 05/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.