{"title":"使用图 p-距离着色算法对某些富勒烯原子进行分区","authors":"Hanifa Mosawi, Mostafa Tavakoli","doi":"10.1080/1536383x.2024.2342684","DOIUrl":null,"url":null,"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...","PeriodicalId":12574,"journal":{"name":"Fullerenes, Nanotubes and Carbon Nanostructures","volume":"1 1","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Using the graph p-distance coloring algorithm for partitioning atoms of some fullerenes\",\"authors\":\"Hanifa Mosawi, Mostafa Tavakoli\",\"doi\":\"10.1080/1536383x.2024.2342684\",\"DOIUrl\":null,\"url\":null,\"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...\",\"PeriodicalId\":12574,\"journal\":{\"name\":\"Fullerenes, Nanotubes and Carbon Nanostructures\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fullerenes, Nanotubes and Carbon Nanostructures\",\"FirstCategoryId\":\"88\",\"ListUrlMain\":\"https://doi.org/10.1080/1536383x.2024.2342684\",\"RegionNum\":4,\"RegionCategory\":\"材料科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"CHEMISTRY, PHYSICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fullerenes, Nanotubes and Carbon Nanostructures","FirstCategoryId":"88","ListUrlMain":"https://doi.org/10.1080/1536383x.2024.2342684","RegionNum":4,"RegionCategory":"材料科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"CHEMISTRY, PHYSICAL","Score":null,"Total":0}
引用次数: 0
摘要
分子图 p-距离着色是一种原子分区,使每组原子之间没有距离小于或等于 p 的路径。富勒烯图是一种平面...
Using the graph p-distance coloring algorithm for partitioning atoms of some fullerenes
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...
期刊介绍:
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.