无环彩色图中的路径计数矩阵

IF 0.6 4区数学 Q3 MATHEMATICS

Graphs and Combinatorics Pub Date : 2024-04-08 DOI:10.1007/s00373-024-02785-6

Sudip Bera

引用次数: 0

摘要

在本文中，我们概括了 R. P. Stanley 关于无循环图中路径枚举的定理。

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

A Matrix for Counting Paths in Acyclic Colored Digraphs

查看原文本刊更多论文

A Matrix for Counting Paths in Acyclic Colored Digraphs

In this paper, we generalize a theorem of R. P. Stanley regarding the enumeration of paths in acyclic digraphs.

求助全文

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

来源期刊

Graphs and Combinatorics 数学-数学

CiteScore

1.00

自引率

14.30%

发文量

160

审稿时长

6 months

期刊介绍： Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.