本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2021-03-10
摘要
Whitney’s 不平等 established an important connection between vertex and edge connectivity and the degree of a graph, which was later generalized to digraphs and to undirected hypergraphs. Here we show, using the most common definitions of connectedness for directed hypergraphs, that an analogous result holds directed hypergraphs. It relates the vertex connectivity under strong vertex elimination, edge connectivity under weak edge elimination, and a suitable degree-like parameter and is a proper generalization of the situation in both digraphs and undirected hypergraphs. We furthermore relate the connectivity parameters of directed hypergraphs with those of its directed bipartite K¨onig representation.
※ 此為已發表論文，全文需透過期刊付費取得