Skip to main content
SpringerLink
Log in

n-Restricted Edge Connectivity of m-Barrel Fullerene Graphs

  • Research Paper
  • Published:
Iranian Journal of Science and Technology, Transactions A: Science Aims and scope Submit manuscript

Abstract

In this paper we obtain \(\lambda ^{(n)}(F(m, k))\) where \(2\le n \le 6\), \(m > 6\) and \(k\ge 0\). Also we calculate \(\lambda ^{(n)}(F(m, k))\) for \(3\le m \le 6\), \(n\ge 2\) and \(k\ge 0\).

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  • Andova V, Kardoš F, Škrekovski R (2016) Mathematical aspects of fullerenes. ARS Math Contemp 11:353–379

    Article  MathSciNet  Google Scholar 

  • Behmaram A, Došlić T, Friedland S (2016) Matching in \(m\)-generalized fullerene graphs. ARS Math Contemp 11:301–313

    Article  MathSciNet  Google Scholar 

  • Brinkmanna G, McKay BD (1969) Construction of planar triangulations with minimum degree \(5\) (Ed. Tutte), Academic Press, New York

  • Cevetković D, Rowilinson P, Flower P, Stevanović D (2002) Constructing fullerene graphs from their eigenvalues and angles. Linear Algebra Appl 356:37–56

    Article  MathSciNet  Google Scholar 

  • Cvetković D, Števanović D (2004) Spectral moments of fullerene graphs. MATCH Commun Math Comput Chem 50:62–72

    MathSciNet  MATH  Google Scholar 

  • Da Ross T, Prato M (1999) Medicinal chemistry with fullerene and fullerene derivatives. Chem Commun 8:663–669

    Article  Google Scholar 

  • Deza A, Deza M, Grishukhin V (1998) Fullerenes and coordination polyhedra versus half-cube embeddings. Discrete Math 192:41–80

    Article  MathSciNet  Google Scholar 

  • Došlić T (2003) Cyclical edge-connectivity of fullerene graphs and \((k, 6)\)-cages. J Math Chem 33:103–112

    Article  MathSciNet  Google Scholar 

  • Došlić T (2013) The smallest eigenvalue of fullerene graphs-closing the gap. MATCH Commun Math Comput Chem 70:73–78

    MathSciNet  MATH  Google Scholar 

  • Graver JE (2004) Encoding fullerenes and geodesic domes. SIAM J Discrete Math 17:596–614

    Article  MathSciNet  Google Scholar 

  • Graver JE (2005) The structure of fullerene signatures. In: DIMACS series in discrete mathematics and theoretical computer science, vol 69. AMS, pp 137–166

  • Graver JE (2006) The independence numbers of fullerenes and benzenoids. Eur J Comb 27:850–863

    Article  MathSciNet  Google Scholar 

  • Kardoš F, Šrekovski R (2008) Cyclic edge-cuts in fullerene graphs. J Math Chem 44:121–132

    Article  MathSciNet  Google Scholar 

  • Kutnar K, Marušič D (2008) On cyclic edge-connectivity of fullerenes. Discrete Appl 156:1661–1669

    Article  MathSciNet  Google Scholar 

  • Pasini A (2001) Four-dimensional football, fullerene and diagram geometry. Discrete Math 238:115–130

    Article  MathSciNet  Google Scholar 

  • Planeix JM, Coustel N, Coq B, Brotons V, Kumbhar PS, Dutartre R, Geneste P, Bernier P, Ajayan PM (1994) Application of carbon nanotubes as supports in heterogenous catalysis. J Am Chem Soc 116:7935–7936

    Article  Google Scholar 

  • Plummer MD (1972) On the cyclic connectivity of planar graphs. Lect Notes Math 303:235–242

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Urmia University, 57135, Urmia, Iran

    Hamid Tarakmi, Habib Azanchilar, Mohsen Ghasemi & Ghodratollah Azadi

Authors
  1. Hamid Tarakmi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Habib Azanchilar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohsen Ghasemi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ghodratollah Azadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohsen Ghasemi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tarakmi, H., Azanchilar, H., Ghasemi, M. et al. n-Restricted Edge Connectivity of m-Barrel Fullerene Graphs. Iran J Sci Technol Trans Sci 45, 997–1004 (2021). https://doi.org/10.1007/s40995-021-01086-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40995-021-01086-4

Keywords

Mathematics Subject Classification

Search

Navigation