fullerene graph
Recently Published Documents


TOTAL DOCUMENTS

5
(FIVE YEARS 2)

H-INDEX

1
(FIVE YEARS 0)

2021 ◽  
Vol 87 (3) ◽  
pp. 621-628
Author(s):  
Meysam Taheri-Dehkordi ◽  
◽  
Gholam Hossein Fath-Tabar

Fullerenes graphs are 3-connected, 3-regular planar graphs with faces including only pentagons and hexagons. If be a graph with a perfect matching, a subgraph H of G is a nice subgraph if G-V(H) has a perfect matching. In this paper, we show that in every fullerene graph arising from smaller fullerenes via chamfer transformation, each pair of pentagons is a nice subgraph.



Author(s):  
Ayesha Shabbir ◽  
Muhammad Faisal Nadeem ◽  
Mohammad Ovais ◽  
Faraha Ashraf ◽  
Sumiya Nasir

Aims and Objective: A fullerene graph is a mathematical model of a fullerene molecule. A fullerene molecule or simply a fullerene is a polyhedral molecule made entirely of carbon atoms other than graphite and diamond. Chemical graph theory is a combination of chemistry and graph theory where graph theoretical concepts used to study physical properties of mathematically modeled chemical compounds. Graph labeling is a vital area of graph theory which has application not only within mathematics but also in computer science, coding theory, medicine, communication networking, chemistry and in many other fields. For example, in chemistry vertex labeling is being used in the constitution of valence isomers and transition labeling to study chemical reaction networks. Method and Results: In terms of graphs vertices represent atoms while edges stand for bonds between atoms. By tvs (tes) we mean the least positive integer for which a graph has a vertex (edge) irregular total labeling such that no two vertices (edges) have same weights. A (3,6)-fullerene graph is a non-classical fullerene whose faces are triangles and hexagons. Here, we study the total vertex (edge) irregularity strength of an arbitrary disjoint union of (3,6)-fullerene graphs and providing their exact values. Conclusion: The lower bound for tvs (tes) depending on the number of vertices, minimum and maximum degree of a graph exists in literature while to get different weights one can use sufficiently large numbers, but it is of no interest. Here, by proving that the lower bound is the upper bound we close the case for (3,6)-fullerene graphs.



Author(s):  
Fatemeh Koorepazan-Moftakhar ◽  
Ali Reza Ashrafi ◽  
Ottorino Ori ◽  
Mihai V. Putz

A fullerene graph is a cubic, planar and 3-connected graph that its faces are pentagons and hexagons. These graphs are the best mathematical models for fullerene molecules, which are polyhedral carbon molecules with atoms arranged in pentagons and hexagons. The topological efficiency index ?, the parameter ?E and the Timisoara-eccentricity index (TM-EC)are three recent parameters for studying fullerenes. The aim of this chapter is to report these parameters for fullerenes. The examples given includes at most 50 carbon atoms.





2013 ◽  
Vol 4 ◽  
pp. 400-405 ◽  
Author(s):  
A Mottaghi ◽  
Ali R Ashrafi

A molecular graph M is a simple graph in which atoms and chemical bonds are the vertices and edges of M, respectively. The molecular graph M is called a fullerene graph, if M is the molecular graph of a fullerene molecule. It is well-known that such molecules exist for even integers n ≥ 24 or n = 20. The aim of this paper is to investigate the topological properties of a class of fullerene molecules containing 60 + 12n carbon atoms.



Sign in / Sign up

Export Citation Format

Share Document