Skip to main content
SpringerLink
Log in
Book cover

Distance, Symmetry, and Topology in Carbon Nanomaterials pp 249–267Cite as

Study of the Bipartite Edge Frustration of Graphs

  • Chapter
  • First Online:

Part of the book series: Carbon Materials: Chemistry and Physics ((CMCP,volume 9))

Abstract

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). This topological index is related to the well-known Max − cut problem, and has important applications in computing stability of fullerenes. In this paper we determine the bipartite edge frustration of some classes of composite graphs. Moreover, this quantity for four classes of graphs arising from a given graph under different types of edge subdivisions is investigated.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  • Ashrafi AR, Iranmanesh MA, Yarahmadi Z (2013) Topological modelling of nanostructures and extended systems. Springer, Dortrecht

    Book  Google Scholar 

  • Barriére L, Comellas F, Dafló C, Fiol MA (2009a) The hierarchical product of graphs. Discret Appl Math 157:36–48

    Article  Google Scholar 

  • Barriére L, Dafló C, Fiol MA, Mitjana M (2009b) The generalized hierarchical product of graphs. Discret Math 309:3871–3881

    Article  Google Scholar 

  • Bondy JA, Locke SC (1986) Largest bipartite subgraphs in triangle-free graphs with maximum degree three. J Graph Theory 10:477–504

    Article  Google Scholar 

  • Cui Q, Wang J (2009) Maximum bipartite subgraphs of cubic triangle-free planar graphs. Discret Math 309:1091–1111

    Article  Google Scholar 

  • Cvetković DM, Doob M, Sachs H (1980) Spectra of graphs– theory and application. Academic, New York

    Google Scholar 

  • Došlić T (2005a) Bipartivity of fullerene graphs and fullerene stability. Chem Phys Lett 412:336–340

    Article  Google Scholar 

  • Došlić T (2005b) Splices, links, and their valence-weighted Wiener polynomials. Graph Theory Notes NY 48:47–55

    Google Scholar 

  • Došlić T, Vukičević D (2007) Computing the bipartite edge frustration of fullerene graphs. Discrete Appl Math 155:1294–1301

    Article  Google Scholar 

  • Edwards CS (1973) Some extremal properties of bipartite subgraphs. Canad J Math 25:475–485

    Article  Google Scholar 

  • Eliasi M, Taeri B (2009) Four new sums of graphs and their Wiener indices. Discret Appl Math 157:794–803

    Article  Google Scholar 

  • Erdös P (1965) On some extremal problems in graph theory. Israel J Math 3:113–116

    Article  Google Scholar 

  • Fajtlowicz S, Larson CE (2003) Graph theoric independence as a predictor of fullerene stability. Chem Phys Lett 377:485–494

    Article  Google Scholar 

  • Ghojavand M, Ashrafi AR (2008) Computing the bipartite edge frustration of some nanotubes. Digest J Nanomater Bios 3:209–2014

    Google Scholar 

  • Hopkins G, Staton W (1982) Extremal bipartite subgraphs of cubic triangle-free graphs. J Graph Theory 6:115–121

    Article  Google Scholar 

  • Imrich W, Klavžar S (2000) Product graphs, structure and recognition. Wiley, New York

    Google Scholar 

  • Mansour T, Schork M (2009) The vertex PI and Szeged index of bridge and chain graphs. Discret Appl Math 157:1600–1606

    Article  Google Scholar 

  • Nordhaus EA, Gaddum JW (1956) On complementary graphs. Am Math Monthly 63:175–177

    Article  Google Scholar 

  • West DB (1996) Introduction to graph theory. Prentice-Hall, Upper Saddle River

    Google Scholar 

  • Yan W, Yang B-Y, Yeh Y-N (2007) The behavior of Wiener indices and polynomials of graphs under five graph decorations. Appl Math Lett 20:290–295

    Article  Google Scholar 

  • Yarahmadi Z (2010) The bipartite edge frustration of extension of splice and link of graphs. Appl Math Lett 23:1077–1081

    Article  Google Scholar 

  • Yarahmadi Z, Ashrafi AR (2011a) Extremal graphs with respect to the bipartite vertex frustration. Appl Math Lett 24:1774–1777

    Article  Google Scholar 

  • Yarahmadi Z, Ashrafi AR (2011b) The bipartite edge frustration of graphs under subdivided edges and their related sums. Comput Math Appl 62:319–325

    Article  Google Scholar 

  • Yarahmadi Z, Ashrafi AR (2013) The bipartite vertex frustration of some infinite families of fullerenes. Fullerene Nanotube Carbon Nanostruct 21:129–133

    Article  Google Scholar 

  • Yarahmadi Z, Došlić T, Ashrafi AR (2010) The bipartite edge frustration of composite graphs. Discret Appl Math 158:1551–1558

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Sciences, Khorramabad Branch, Islamic Azad University, Khorramabad, Iran

    Zahra Yarahmadi

Authors
  1. Zahra Yarahmadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zahra Yarahmadi .

Editor information

Editors and Affiliations

  1. Department of Nanocomputing, Institute of Nanoscience and Nanotechnology, University of Kashan, Kashan, Iran

    Ali Reza Ashrafi

  2. Department of Chemistry, Faculty of Chemistry and Chemical Engineering, Babes-Bolyai University, Cluj-Napoca, Romania

    Mircea V. Diudea

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Yarahmadi, Z. (2016). Study of the Bipartite Edge Frustration of Graphs. In: Ashrafi, A., Diudea, M. (eds) Distance, Symmetry, and Topology in Carbon Nanomaterials. Carbon Materials: Chemistry and Physics, vol 9. Springer, Cham. https://doi.org/10.1007/978-3-319-31584-3_15

Download citation

Publish with us

Policies and ethics

Search

Navigation