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 planar 3-connected cubic graph whose faces are pentagons and hexagons. In this paper we apply some existing coloring algorithms for partitioning atoms of fullerenes based on their distances from each other. We also use these algorithm for coloring faces of some fullerenes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
