图的跨偶数树

IF 0.9 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2024-05-08 DOI:10.1002/jgt.23115

Bill Jackson, Kiyoshi Yoshimoto

{"title":"图的跨偶数树","authors":"Bill Jackson, Kiyoshi Yoshimoto","doi":"10.1002/jgt.23115","DOIUrl":null,"url":null,"abstract":"A tree <math>\n <semantics>\n <mrow>\n <mi>T</mi>\n </mrow>\n <annotation> $T$</annotation>\n </semantics></math> is said to be even if all pairs of vertices of degree one in <math>\n <semantics>\n <mrow>\n <mi>T</mi>\n </mrow>\n <annotation> $T$</annotation>\n </semantics></math> are joined by a path of even length. We conjecture that every <math>\n <semantics>\n <mrow>\n <mi>r</mi>\n </mrow>\n <annotation> $r$</annotation>\n </semantics></math>-regular nonbipartite connected graph <math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> has a spanning even tree and verify this conjecture when <math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> has a 2-factor. Well-known results of Petersen and Hanson et al. imply that the only remaining unsolved case is when <math>\n <semantics>\n <mrow>\n <mi>r</mi>\n </mrow>\n <annotation> $r$</annotation>\n </semantics></math> is odd and <math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> has at least <math>\n <semantics>\n <mrow>\n <mi>r</mi>\n </mrow>\n <annotation> $r$</annotation>\n </semantics></math> bridges. We investigate this case further and propose some related conjectures.","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"107 1","pages":"95-106"},"PeriodicalIF":0.9000,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Spanning even trees of graphs\",\"authors\":\"Bill Jackson, Kiyoshi Yoshimoto\",\"doi\":\"10.1002/jgt.23115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A tree <math>\\n <semantics>\\n <mrow>\\n <mi>T</mi>\\n </mrow>\\n <annotation> $T$</annotation>\\n </semantics></math> is said to be even if all pairs of vertices of degree one in <math>\\n <semantics>\\n <mrow>\\n <mi>T</mi>\\n </mrow>\\n <annotation> $T$</annotation>\\n </semantics></math> are joined by a path of even length. We conjecture that every <math>\\n <semantics>\\n <mrow>\\n <mi>r</mi>\\n </mrow>\\n <annotation> $r$</annotation>\\n </semantics></math>-regular nonbipartite connected graph <math>\\n <semantics>\\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n <annotation> $G$</annotation>\\n </semantics></math> has a spanning even tree and verify this conjecture when <math>\\n <semantics>\\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n <annotation> $G$</annotation>\\n </semantics></math> has a 2-factor. Well-known results of Petersen and Hanson et al. imply that the only remaining unsolved case is when <math>\\n <semantics>\\n <mrow>\\n <mi>r</mi>\\n </mrow>\\n <annotation> $r$</annotation>\\n </semantics></math> is odd and <math>\\n <semantics>\\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n <annotation> $G$</annotation>\\n </semantics></math> has at least <math>\\n <semantics>\\n <mrow>\\n <mi>r</mi>\\n </mrow>\\n <annotation> $r$</annotation>\\n </semantics></math> bridges. We investigate this case further and propose some related conjectures.\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\"107 1\",\"pages\":\"95-106\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23115\",\"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://onlinelibrary.wiley.com/doi/10.1002/jgt.23115","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

如果所有阶数为 1 的顶点对都由一条长度为偶数的路径连接，则称该树为偶数树。我们猜想，每一个-规则的非双方形连通图都有一棵跨度为偶数的树，并在有 2 因子时验证了这一猜想。Petersen 和 Hanson 等人的著名结果意味着，唯一剩下的未解情况是奇数且至少有桥。我们将进一步研究这种情况，并提出一些相关猜想。

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

查看原文本刊更多论文

Spanning even trees of graphs

A tree $T$ is said to be even if all pairs of vertices of degree one in $T$ are joined by a path of even length. We conjecture that every $r$ -regular nonbipartite connected graph $G$ has a spanning even tree and verify this conjecture when $G$ has a 2-factor. Well-known results of Petersen and Hanson et al. imply that the only remaining unsolved case is when $r$ is odd and $G$ has at least $r$ bridges. We investigate this case further and propose some related conjectures.

求助全文

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

来源期刊

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 .