发布求助
文献互助 智能选刊 最新文献

A Matrix for Counting Paths in Acyclic Colored Digraphs

Pub Date : 2024-04-08 DOI:10.1007/s00373-024-02785-6
Sudip Bera
{"title":"A Matrix for Counting Paths in Acyclic Colored Digraphs","authors":"Sudip Bera","doi":"10.1007/s00373-024-02785-6","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we generalize a theorem of R. P. Stanley regarding the enumeration of paths in acyclic digraphs.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00373-024-02785-6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

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

Abstract Image

分享
查看原文
无环彩色图中的路径计数矩阵
在本文中，我们概括了 R. P. Stanley 关于无循环图中路径枚举的定理。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信