具有至少2个顶点的无环图是可识别的

IF 0.9 3区数学 Q2 MATHEMATICS Journal of Graph Theory Pub Date : 2023-08-22 DOI:10.1002/jgt.23027

A. Kostochka, M. Nahvi, D. West, Dara Zirlin

{"title":"具有至少2个顶点的无环图是可识别的","authors":"A. Kostochka, M. Nahvi, D. West, Dara Zirlin","doi":"10.1002/jgt.23027","DOIUrl":null,"url":null,"abstract":"The ‐deck of an ‐vertex graph is the multiset of subgraphs obtained from it by deleting vertices. A family of ‐vertex graphs is ‐recognizable if every graph having the same ‐deck as a graph in the family is also in the family. We prove that the family of ‐vertex graphs with no cycles is ‐recognizable when (except for ). As a consequence, the family of ‐vertex trees is ‐recognizable when and . It is known that this fails when .","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":" ","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2023-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Acyclic graphs with at least 2ℓ + 1 vertices are ℓ‐recognizable\",\"authors\":\"A. Kostochka, M. Nahvi, D. West, Dara Zirlin\",\"doi\":\"10.1002/jgt.23027\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The ‐deck of an ‐vertex graph is the multiset of subgraphs obtained from it by deleting vertices. A family of ‐vertex graphs is ‐recognizable if every graph having the same ‐deck as a graph in the family is also in the family. We prove that the family of ‐vertex graphs with no cycles is ‐recognizable when (except for ). As a consequence, the family of ‐vertex trees is ‐recognizable when and . It is known that this fails when .\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1002/jgt.23027\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1002/jgt.23027","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 1

摘要

顶点图的甲板是通过删除顶点从中获得的多个子图集。如果每个与族中的图具有相同甲板的图也在族中，则顶点图族是可识别的。我们证明了无环的顶点图族在（除）时是可识别的。因此，当和时，顶点树族是可识别的。众所周知，当。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Acyclic graphs with at least 2ℓ + 1 vertices are ℓ‐recognizable

The ‐deck of an ‐vertex graph is the multiset of subgraphs obtained from it by deleting vertices. A family of ‐vertex graphs is ‐recognizable if every graph having the same ‐deck as a graph in the family is also in the family. We prove that the family of ‐vertex graphs with no cycles is ‐recognizable when (except for ). As a consequence, the family of ‐vertex trees is ‐recognizable when and . It is known that this fails when .

求助全文

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

来源期刊

Journal of Graph Theory 数学-数学

CiteScore

1.60

自引率

22.20%

发文量

130

审稿时长

6-12 weeks

期刊介绍： The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .

期刊最新文献

Issue Information Edge‐transitive cubic graphs of twice square‐free order Breaking small automorphisms by list colourings Compatible powers of Hamilton cycles in dense graphs Fractional factors and component factors in graphs with isolated toughness smaller than 1