有向图的终度

IF 1 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2026-10-12 Epub Date: 2026-06-16 DOI:10.1002/jgt.70084

Matthias Hamann, Karl Heuer

{"title":"有向图的终度","authors":"Matthias Hamann, Karl Heuer","doi":"10.1002/jgt.70084","DOIUrl":null,"url":null,"abstract":"<p>In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices dominating the end, which we denote as combined end degree. Our main result is a characterisation of the combined end degree in terms of certain sequences of vertices, which we call end-exhausting sequences. This establishes a similar, although more complex relationship as known for the combined end degree and end-defining sequences in undirected graphs.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"113 4","pages":"606-618"},"PeriodicalIF":1.0000,"publicationDate":"2026-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.70084","citationCount":"0","resultStr":"{\"title\":\"An End Degree for Digraphs\",\"authors\":\"Matthias Hamann, Karl Heuer\",\"doi\":\"10.1002/jgt.70084\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices dominating the end, which we denote as combined end degree. Our main result is a characterisation of the combined end degree in terms of certain sequences of vertices, which we call end-exhausting sequences. This establishes a similar, although more complex relationship as known for the combined end degree and end-defining sequences in undirected graphs.</p>\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\"113 4\",\"pages\":\"606-618\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2026-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.70084\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.70084\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2026/6/16 0:00:00\",\"PubModel\":\"Epub\",\"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.70084","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/6/16 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

本文定义了无限有向图端点的度数。我们定义的明确性特别解决了祖瑟的一个问题。此外，我们将端点度的概念扩展到也尊重，除其他外，支配端点的顶点，我们将其称为组合端点度。我们的主要结果是用某些顶点序列来描述组合的端点度，我们称之为端点耗尽序列。这建立了一个类似的，虽然更复杂的关系，众所周知的无向图中的组合结束度和结束定义序列。

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

查看原文本刊更多论文

An End Degree for Digraphs

In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices dominating the end, which we denote as combined end degree. Our main result is a characterisation of the combined end degree in terms of certain sequences of vertices, which we call end-exhausting sequences. This establishes a similar, although more complex relationship as known for the combined end degree and end-defining sequences in undirected graphs.

求助全文

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

来源期刊

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 .