某些特定图的反强迫数

IF 1 Q4 CHEMISTRY, MULTIDISCIPLINARY

Iranian journal of mathematical chemistry Pub Date : 2017-09-01 DOI:10.22052/IJMC.2017.60978.1235

S. Alikhani, N. Soltani

{"title":"某些特定图的反强迫数","authors":"S. Alikhani, N. Soltani","doi":"10.22052/IJMC.2017.60978.1235","DOIUrl":null,"url":null,"abstract":"Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specific graphs that are of importance in chemistry and study their anti-forcing numbers.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Anti-forcing number of some specific graphs\",\"authors\":\"S. Alikhani, N. Soltani\",\"doi\":\"10.22052/IJMC.2017.60978.1235\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specific graphs that are of importance in chemistry and study their anti-forcing numbers.\",\"PeriodicalId\":14545,\"journal\":{\"name\":\"Iranian journal of mathematical chemistry\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Iranian journal of mathematical chemistry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22052/IJMC.2017.60978.1235\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iranian journal of mathematical chemistry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22052/IJMC.2017.60978.1235","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 1

摘要

设$G=(V,E)$是一个简单连通图。$G$的完美匹配(或化学文献中的Kekul'e结构)是一组不相交的边，覆盖$G$的所有顶点。$G$的反强迫数是使删除这些边得到的剩余图具有唯一完美匹配的最小边数，记为$af(G)$。本文考虑了化学中一些重要的特殊图，并研究了它们的反强迫数。

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

查看原文本刊更多论文

Anti-forcing number of some specific graphs

Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specific graphs that are of importance in chemistry and study their anti-forcing numbers.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Iranian journal of mathematical chemistry CHEMISTRY, MULTIDISCIPLINARY-

CiteScore

2.10

自引率

7.70%

发文量