{"title":"中离子结构的标准","authors":"Georgii N. Sizov, E. Babaev","doi":"10.46793/match.89-1.005s","DOIUrl":null,"url":null,"abstract":"In the article, at the mathematical level of rigor, it is shown that the pair of concepts \"covalence – mesoionicity\" correlates in the same way as the pair \"kekuleness – non-kekuleness\". A criterion for a structure to be mesoionic (mesoionicity criterion) is formulated and proved, which makes it possible to enumerate all mono-charged mesoionic structures (mesomeric betaines) on a given graph. The mesoionicity criterion and the Kasteleyn theorem (on counting the number of perfect matchings in a graph) were used as the basis for a computer program that classifies dipolar resonance structures. The work of the program is demonstrated on the lists of obtained mesoionic structures. A general approach to mesoionicity is discussed.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":"24 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Criteria for a Structure to be Mesoionic\",\"authors\":\"Georgii N. Sizov, E. Babaev\",\"doi\":\"10.46793/match.89-1.005s\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the article, at the mathematical level of rigor, it is shown that the pair of concepts \\\"covalence – mesoionicity\\\" correlates in the same way as the pair \\\"kekuleness – non-kekuleness\\\". A criterion for a structure to be mesoionic (mesoionicity criterion) is formulated and proved, which makes it possible to enumerate all mono-charged mesoionic structures (mesomeric betaines) on a given graph. The mesoionicity criterion and the Kasteleyn theorem (on counting the number of perfect matchings in a graph) were used as the basis for a computer program that classifies dipolar resonance structures. The work of the program is demonstrated on the lists of obtained mesoionic structures. A general approach to mesoionicity is discussed.\",\"PeriodicalId\":51115,\"journal\":{\"name\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"volume\":\"24 1\",\"pages\":\"\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2022-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"FirstCategoryId\":\"92\",\"ListUrlMain\":\"https://doi.org/10.46793/match.89-1.005s\",\"RegionNum\":2,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Match-Communications in Mathematical and in Computer Chemistry","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.46793/match.89-1.005s","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
In the article, at the mathematical level of rigor, it is shown that the pair of concepts "covalence – mesoionicity" correlates in the same way as the pair "kekuleness – non-kekuleness". A criterion for a structure to be mesoionic (mesoionicity criterion) is formulated and proved, which makes it possible to enumerate all mono-charged mesoionic structures (mesomeric betaines) on a given graph. The mesoionicity criterion and the Kasteleyn theorem (on counting the number of perfect matchings in a graph) were used as the basis for a computer program that classifies dipolar resonance structures. The work of the program is demonstrated on the lists of obtained mesoionic structures. A general approach to mesoionicity is discussed.
期刊介绍：
MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
