127
Views
0
CrossRef citations to date
0
Altmetric
Research Articles

Total Irregularity Strengths of a Disjoint Union of (4,6)-Fullerene Graphs

ORCID Icon, &
Pages 3651-3669 | Received 24 Oct 2021, Accepted 02 May 2022, Published online: 24 May 2022
 

Abstract

A fullerene is a polyhedral molecule made entirely of carbon atoms other than graphite and diamond. Mathematical chemistry or Chemical graph theory as a combination of chemistry and graph theory studies the physical properties of mathematically modeled chemical compounds. Graph labeling is a vital area of graph theory that has applications in both physical and social sciences. For example, in chemistry vertex labeling is used in the constitution of valence isomers and transition labeling to study chemical reaction networks. A (4,6)-fullerene graph is a mathematical model of a (4,6)-fullerene molecule. It is a cubic-regular planar graph whose faces are squares and hexagons. In this article, we study the total vertex irregularity strength and the total edge irregularity strength of a disjoint union of (4,6)-fullerene graphs and provide their exact values.

Mathematics Subject Classification:

View correction statement:
Correction

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

The research for this article was supported by APVV-15-0116 and VEGA 1/0233/18.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.