{"title":"不匹配的伪森林","authors":"Yasemin Büyükçolak , Didem Gözüpek , Sibel Özkan","doi":"10.1016/j.dam.2024.09.018","DOIUrl":null,"url":null,"abstract":"<div><div>A graph is called well-indumatched if all of its maximal induced matchings have the same size. Akbari et al. (0000) provided a characterization of well-indumatched trees and some results on well-indumatched unicyclic graphs. In this paper, we extend this result by providing a complete structural characterization of well-indumatched pseudotrees, in which each component has no cycle or a unique cycle, by identifying the well-indumatched graph families.</div></div>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Well-indumatched Pseudoforests\",\"authors\":\"Yasemin Büyükçolak , Didem Gözüpek , Sibel Özkan\",\"doi\":\"10.1016/j.dam.2024.09.018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>A graph is called well-indumatched if all of its maximal induced matchings have the same size. Akbari et al. (0000) provided a characterization of well-indumatched trees and some results on well-indumatched unicyclic graphs. In this paper, we extend this result by providing a complete structural characterization of well-indumatched pseudotrees, in which each component has no cycle or a unique cycle, by identifying the well-indumatched graph families.</div></div>\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2024-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0166218X24004086\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X24004086","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
A graph is called well-indumatched if all of its maximal induced matchings have the same size. Akbari et al. (0000) provided a characterization of well-indumatched trees and some results on well-indumatched unicyclic graphs. In this paper, we extend this result by providing a complete structural characterization of well-indumatched pseudotrees, in which each component has no cycle or a unique cycle, by identifying the well-indumatched graph families.
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.