• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

任意不交并(3,6)-富勒烯的总非正则强度。

Total Irregularity Strengths of an Arbitrary Disjoint Union of (3,6)- Fullerenes.

机构信息

Preparatory Year Deanship, King Faisal University, 31982, Hofuf, Al Ahsa,Saudi Arabia.

Department of Mathematics, COMSATS University Islamabad Lahore Campus, Lahore,Pakistan.

出版信息

Comb Chem High Throughput Screen. 2022;25(3):500-509. doi: 10.2174/1386207323666201209094514.

DOI:10.2174/1386207323666201209094514
PMID:33297913
Abstract

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 theoretical graph concepts are used to study the physical properties of mathematically modeled chemical compounds. Graph labeling is a vital area of graph theory that has application not only within mathematics but also in computer science, coding theory, medicine, communication networking, chemistry, among 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: In terms of graphs, vertices represent atoms while edges stand for bonds between the 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 the same weights. A (3,6)-fullerene graph is a non-classical fullerene whose faces are triangles and hexagons Results: Here, we study the total vertex (edge) irregularity strength of an arbitrary disjoint union of (3,6)-fullerene graphs and provide their exact values.

CONCLUSION

The lower bound for tvs (tes) depends on the number of vertices. Minimum and maximum degree of a graph exist 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.

摘要

目的和目标

富勒烯图是富勒烯分子的数学模型。富勒烯分子,或简称富勒烯,是一种完全由碳原子组成的多面体分子,不同于石墨和钻石。化学图论是化学和图论的结合,其中理论图概念被用于研究数学建模化合物的物理性质。图标记是图论的一个重要领域,不仅在数学中,而且在计算机科学、编码理论、医学、通信网络、化学等领域都有应用。例如,在化学中,顶点标记用于构成价异构体和过渡标记,以研究化学反应网络。方法:在图论中,顶点表示原子,边表示原子之间的键。通过 tvs(tes),我们指的是一个最小的正整数,对于这个正整数,一个图具有一个顶点(边)不规则的总标记,使得没有两个顶点(边)具有相同的权重。(3,6)-富勒烯图是非经典富勒烯,其面是三角形和六边形。结果:在这里,我们研究了任意不交并的(3,6)-富勒烯图的总顶点(边)不规则强度,并给出了它们的确切值。结论:tvs(tes)的下界取决于顶点的数量。图的最小和最大度在文献中已经存在,而要获得不同的权重,可以使用足够大的数字,但这没有意义。在这里,通过证明下界是上界,我们解决了(3,6)-富勒烯图的情况。

相似文献

1
Total Irregularity Strengths of an Arbitrary Disjoint Union of (3,6)- Fullerenes.任意不交并(3,6)-富勒烯的总非正则强度。
Comb Chem High Throughput Screen. 2022;25(3):500-509. doi: 10.2174/1386207323666201209094514.
2
Nonbonding orbitals in fullerenes: nuts and cores in singular polyhedral graphs.富勒烯中的非键轨道:奇异多面体图中的节点和核心
J Chem Inf Model. 2007 Sep-Oct;47(5):1763-75. doi: 10.1021/ci700097j. Epub 2007 Aug 10.
3
Two types irregular labelling on dodecahedral modified generalization graph.十二面体修正广义图上的两种不规则标记。
Heliyon. 2022 Oct 20;8(11):e11197. doi: 10.1016/j.heliyon.2022.e11197. eCollection 2022 Nov.
4
Topological edge properties of C60+12 n fullerenes.C60+12n 富勒烯的拓扑边缘特性。
Beilstein J Nanotechnol. 2013 Jun 26;4:400-5. doi: 10.3762/bjnano.4.47. Print 2013.
5
Distributed curvature and stability of fullerenes.富勒烯的分布曲率与稳定性
Phys Chem Chem Phys. 2015 Sep 21;17(35):23257-64. doi: 10.1039/c5cp03643g. Epub 2015 Aug 18.
6
On the centrality of vertices of molecular graphs.关于分子图顶点的中心性。
J Comput Chem. 2013 Nov 5;34(29):2514-23. doi: 10.1002/jcc.23413. Epub 2013 Aug 19.
7
Seeing the results of a mutation with a vertex weighted hierarchical graph.通过顶点加权层次图查看突变结果。
BMC Proc. 2014 Aug 28;8(Suppl 2 Proceedings of the 3rd Annual Symposium on Biologica):S7. doi: 10.1186/1753-6561-8-S2-S7. eCollection 2014.
8
Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO) tetrahedra.链状、带状和管状硅酸盐的键拓扑结构。第一部分。(TO)四面体无限一维排列的图论生成。
Acta Crystallogr A Found Adv. 2022 May 1;78(Pt 3):212-233. doi: 10.1107/S2053273322001747. Epub 2022 Apr 4.
9
The topology of fullerenes.富勒烯的拓扑结构。
Wiley Interdiscip Rev Comput Mol Sci. 2015 Jan;5(1):96-145. doi: 10.1002/wcms.1207.
10
On the Decomposition of Vertex-Transitive Graphs into Multicycles.关于顶点传递图分解为多圈图的研究
J Res Natl Bur Stand (1977). 1983 Nov-Dec;88(6):403-410. doi: 10.6028/jres.088.021.