Advertisement

Study of the Bipartite Edge Frustration of Graphs

  • Zahra YarahmadiEmail author
Chapter
Part of the Carbon Materials: Chemistry and Physics book series (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.

Keywords

Bipartite Graph Black Vertex Root Vertex Composite Graph Chain Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Ashrafi AR, Iranmanesh MA, Yarahmadi Z (2013) Topological modelling of nanostructures and extended systems. Springer, DortrechtCrossRefGoogle Scholar
  2. Barriére L, Comellas F, Dafló C, Fiol MA (2009a) The hierarchical product of graphs. Discret Appl Math 157:36–48CrossRefGoogle Scholar
  3. Barriére L, Dafló C, Fiol MA, Mitjana M (2009b) The generalized hierarchical product of graphs. Discret Math 309:3871–3881CrossRefGoogle Scholar
  4. Bondy JA, Locke SC (1986) Largest bipartite subgraphs in triangle-free graphs with maximum degree three. J Graph Theory 10:477–504CrossRefGoogle Scholar
  5. Cui Q, Wang J (2009) Maximum bipartite subgraphs of cubic triangle-free planar graphs. Discret Math 309:1091–1111CrossRefGoogle Scholar
  6. Cvetković DM, Doob M, Sachs H (1980) Spectra of graphs– theory and application. Academic, New YorkGoogle Scholar
  7. Došlić T (2005a) Bipartivity of fullerene graphs and fullerene stability. Chem Phys Lett 412:336–340CrossRefGoogle Scholar
  8. Došlić T (2005b) Splices, links, and their valence-weighted Wiener polynomials. Graph Theory Notes NY 48:47–55Google Scholar
  9. Došlić T, Vukičević D (2007) Computing the bipartite edge frustration of fullerene graphs. Discrete Appl Math 155:1294–1301CrossRefGoogle Scholar
  10. Edwards CS (1973) Some extremal properties of bipartite subgraphs. Canad J Math 25:475–485CrossRefGoogle Scholar
  11. Eliasi M, Taeri B (2009) Four new sums of graphs and their Wiener indices. Discret Appl Math 157:794–803CrossRefGoogle Scholar
  12. Erdös P (1965) On some extremal problems in graph theory. Israel J Math 3:113–116CrossRefGoogle Scholar
  13. Fajtlowicz S, Larson CE (2003) Graph theoric independence as a predictor of fullerene stability. Chem Phys Lett 377:485–494CrossRefGoogle Scholar
  14. Ghojavand M, Ashrafi AR (2008) Computing the bipartite edge frustration of some nanotubes. Digest J Nanomater Bios 3:209–2014Google Scholar
  15. Hopkins G, Staton W (1982) Extremal bipartite subgraphs of cubic triangle-free graphs. J Graph Theory 6:115–121CrossRefGoogle Scholar
  16. Imrich W, Klavžar S (2000) Product graphs, structure and recognition. Wiley, New YorkGoogle Scholar
  17. Mansour T, Schork M (2009) The vertex PI and Szeged index of bridge and chain graphs. Discret Appl Math 157:1600–1606CrossRefGoogle Scholar
  18. Nordhaus EA, Gaddum JW (1956) On complementary graphs. Am Math Monthly 63:175–177CrossRefGoogle Scholar
  19. West DB (1996) Introduction to graph theory. Prentice-Hall, Upper Saddle RiverGoogle Scholar
  20. 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–295CrossRefGoogle Scholar
  21. Yarahmadi Z (2010) The bipartite edge frustration of extension of splice and link of graphs. Appl Math Lett 23:1077–1081CrossRefGoogle Scholar
  22. Yarahmadi Z, Ashrafi AR (2011a) Extremal graphs with respect to the bipartite vertex frustration. Appl Math Lett 24:1774–1777CrossRefGoogle Scholar
  23. Yarahmadi Z, Ashrafi AR (2011b) The bipartite edge frustration of graphs under subdivided edges and their related sums. Comput Math Appl 62:319–325CrossRefGoogle Scholar
  24. Yarahmadi Z, Ashrafi AR (2013) The bipartite vertex frustration of some infinite families of fullerenes. Fullerene Nanotube Carbon Nanostruct 21:129–133CrossRefGoogle Scholar
  25. Yarahmadi Z, Došlić T, Ashrafi AR (2010) The bipartite edge frustration of composite graphs. Discret Appl Math 158:1551–1558CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Mathematics, Faculty of SciencesKhorramabad Branch, Islamic Azad UniversityKhorramabadIran

Personalised recommendations