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 we extend the splice and link for two graphs and determine their bipartite edge frustration. As an application, the bipartite edge frustration of a polybuckyball is computed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
