• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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, 4), 4}-富勒烯的反凯库勒数

Anti-Kekulé number of the {(3, 4), 4}-fullerene.

作者信息

Yang Rui, Jia Huimin

机构信息

School of Mathematics and Information Science, Henan Polytechnic University, Jiaozuo, Henan, China.

出版信息

Front Chem. 2023 Feb 24;11:1132587. doi: 10.3389/fchem.2023.1132587. eCollection 2023.

DOI:10.3389/fchem.2023.1132587
PMID:36909705
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC10000290/
Abstract

A is a 4-regular plane graph with exactly eight triangular faces and other quadrangular faces. An edge subset of is called an , if - is a connected subgraph without perfect matchings. The of is the smallest cardinality of anti-Kekulé sets and is denoted by . In this paper, we show that ; at the same time, we determine that the {(3, 4), 4}-fullerene graph with anti-Kekulé number 4 consists of two kinds of graphs: one of which is the graph consisting of the tubular graph , where is composed of concentric layers of quadrangles, capped on each end by a cap formed by four triangles which share a common vertex (see Figure 2 for the graph ); and the other is the graph , which contains four diamonds , , , and , where each diamond consists of two adjacent triangles with a common edge such that four edges , , , and form a matching (see Figure 7D for the four diamonds - ). As a consequence, we prove that if , then ; moreover, if , we give the condition to judge that the anti-Kekulé number of graph is 4 or 5.

摘要

A是一个4正则平面图,恰好有八个三角形面和其他四边形面。的一个边子集被称为一个反凯库勒集,如果(G - S)是一个没有完美匹配的连通子图。的反凯库勒数是反凯库勒集的最小基数,用(ak(G))表示。在本文中,我们证明了(ak(G)\geq4);同时,我们确定反凯库勒数为4的({(3, 4), 4}) - 富勒烯图由两种图组成:一种是由管状图(T_n)构成的图(G_1),其中(T_n)由(n)个同心四边形层组成,两端由四个共享一个公共顶点的三角形形成的帽封顶(图(G_1)见图2);另一种是图(G_2),它包含四个菱形(D_1)、(D_2)、(D_3)和(D_4),其中每个菱形(D_i)由两个有公共边的相邻三角形组成,使得四条边(e_1)、(e_2)、(e_3)和(e_4)形成一个匹配(四个菱形(D_1 - D_4)见图7D)。因此,我们证明了如果(G)是({(3, 4), 4}) - 富勒烯图,那么(ak(G)\geq4);此外,如果(G)是({(3, 4), 4}) - 富勒烯图,我们给出判断图(G)的反凯库勒数是4还是5的条件。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/e5646272e651/fchem-11-1132587-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/e13c5e895596/fchem-11-1132587-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/28492bcf9b39/fchem-11-1132587-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/2ed995bfaa8b/fchem-11-1132587-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/41f088c33dfc/fchem-11-1132587-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/753f6b17512b/fchem-11-1132587-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/d021b2d4e7cb/fchem-11-1132587-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/919bc7d9f4cd/fchem-11-1132587-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/dce3c6b533cd/fchem-11-1132587-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/e5646272e651/fchem-11-1132587-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/e13c5e895596/fchem-11-1132587-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/28492bcf9b39/fchem-11-1132587-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/2ed995bfaa8b/fchem-11-1132587-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/41f088c33dfc/fchem-11-1132587-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/753f6b17512b/fchem-11-1132587-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/d021b2d4e7cb/fchem-11-1132587-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/919bc7d9f4cd/fchem-11-1132587-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/dce3c6b533cd/fchem-11-1132587-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/6899/10000290/e5646272e651/fchem-11-1132587-g009.jpg

相似文献

1
Anti-Kekulé number of the {(3, 4), 4}-fullerene.{(3, 4), 4}-富勒烯的反凯库勒数
Front Chem. 2023 Feb 24;11:1132587. doi: 10.3389/fchem.2023.1132587. eCollection 2023.
2
Connectivity of Triangulation Flip Graphs in the Plane.平面三角剖分翻转图的连通性
Discrete Comput Geom. 2022;68(4):1227-1284. doi: 10.1007/s00454-022-00436-2. Epub 2022 Nov 14.
3
The reflexive edge strength on some almost regular graphs.某些几乎正则图上的自反边强度。
Heliyon. 2021 May 6;7(5):e06991. doi: 10.1016/j.heliyon.2021.e06991. eCollection 2021 May.
4
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.
5
A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.一种对某些平面图类进行 4 着色的线性时间算法。
Comput Intell Neurosci. 2021 Oct 5;2021:7667656. doi: 10.1155/2021/7667656. eCollection 2021.
6
Local Multiset Dimension of Amalgamation Graphs.并图的局部多重集维数。
F1000Res. 2024 Apr 23;12:95. doi: 10.12688/f1000research.128866.2. eCollection 2023.
7
The dominant metric dimension of graphs.图的主导度量维度
Heliyon. 2020 Mar 23;6(3):e03633. doi: 10.1016/j.heliyon.2020.e03633. eCollection 2020 Mar.
8
Edge Mostar Indices of Cacti Graph With Fixed Cycles.具有固定圈的仙人掌图的边莫斯塔指数
Front Chem. 2021 Jul 9;9:693885. doi: 10.3389/fchem.2021.693885. eCollection 2021.
9
On Hamiltonian Decomposition Problem of 3-Arc Graphs.关于三弧图的哈密顿分解问题
Comput Intell Neurosci. 2022 Apr 28;2022:5837405. doi: 10.1155/2022/5837405. eCollection 2022.
10
On the antimagicness of generalized edge corona graphs.关于广义边冠图的反魔法性
Heliyon. 2024 Jan 5;10(2):e24002. doi: 10.1016/j.heliyon.2024.e24002. eCollection 2024 Jan 30.