具有唯一极大独立集的树及其线性性质

IF 0.6 4区数学 Q3 MATHEMATICS

Revista De La Union Matematica Argentina Pub Date : 2022-06-08 DOI:10.33044/revuma.1145

D. Jaume, Gonzalo Molina, Rodrigo Sota

{"title":"具有唯一极大独立集的树及其线性性质","authors":"D. Jaume, Gonzalo Molina, Rodrigo Sota","doi":"10.33044/revuma.1145","DOIUrl":null,"url":null,"abstract":"Trees with a unique maximum independent set encode the maximum matching structure in every tree. In this work we study some of their linear properties and give two graph operations, stellare and S-coalescence, which allow building all trees with a unique maximum independent set. The null space structure of any tree can be understood in terms of these graph operations.","PeriodicalId":54469,"journal":{"name":"Revista De La Union Matematica Argentina","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2022-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Trees with a unique maximum independent set and their linear properties\",\"authors\":\"D. Jaume, Gonzalo Molina, Rodrigo Sota\",\"doi\":\"10.33044/revuma.1145\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Trees with a unique maximum independent set encode the maximum matching structure in every tree. In this work we study some of their linear properties and give two graph operations, stellare and S-coalescence, which allow building all trees with a unique maximum independent set. The null space structure of any tree can be understood in terms of these graph operations.\",\"PeriodicalId\":54469,\"journal\":{\"name\":\"Revista De La Union Matematica Argentina\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Revista De La Union Matematica Argentina\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.33044/revuma.1145\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Revista De La Union Matematica Argentina","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.33044/revuma.1145","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

具有唯一最大独立集的树对每棵树的最大匹配结构进行编码。在本文中，我们研究了它们的一些线性性质，并给出了两种图运算，星形和s -聚结，这两种图运算允许构造具有唯一最大独立集的所有树。任何树的零空间结构都可以用这些图运算来理解。

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

查看原文本刊更多论文

Trees with a unique maximum independent set and their linear properties

Trees with a unique maximum independent set encode the maximum matching structure in every tree. In this work we study some of their linear properties and give two graph operations, stellare and S-coalescence, which allow building all trees with a unique maximum independent set. The null space structure of any tree can be understood in terms of these graph operations.

求助全文

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

来源期刊

Revista De La Union Matematica Argentina MATHEMATICS, APPLIED-MATHEMATICS

CiteScore

0.70

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Revista de la Unión Matemática Argentina is an open access journal, free of charge for both authors and readers. We publish original research articles in all areas of pure and applied mathematics.