Using the graph p-distance coloring algorithm for partitioning atoms of some fullerenes

IF 2.1 4区材料科学 Q3 CHEMISTRY, PHYSICAL

Fullerenes, Nanotubes and Carbon Nanostructures Pub Date : 2024-04-18 DOI:10.1080/1536383x.2024.2342684

Hanifa Mosawi, Mostafa Tavakoli

引用次数: 0

Abstract

A molecular graph p-distance coloring is a partitioning of atoms in such a way that there are no path of distance less than or equal to p between the atoms of each set. A fullerene graph is a plana...

查看原文本刊更多论文

使用图 p-距离着色算法对某些富勒烯原子进行分区

分子图 p-距离着色是一种原子分区，使每组原子之间没有距离小于或等于 p 的路径。富勒烯图是一种平面...

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Fullerenes, Nanotubes and Carbon Nanostructures 工程技术-材料科学：综合

CiteScore

4.80

自引率

17.40%

发文量

审稿时长

1 months

期刊介绍： The international and interdisciplinary forum, Fullerenes, Nanotubes, and Carbon Nanostructures , aims at publishing peer-reviewed research of original work in all areas of CARBON research including fullerenes, nanotubes, nanodiamond, graphene, any type of carbon nanostructure and any work dealing with carbon and carbon-related topics. Publishing high quality papers from all fields of carbon science and related topics, the journal intends to provide a means of communication between researchers who are interested in fundamental and applied carbon science issues.