arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1701.08538math.CO
收藏

关于变换有向图的相交数

On the Intersection Number of Transformed Digraphs

Diljit Singh

摘要:

对于任何简单的有向图$D$,我们提供了一个新的证明,它的中间有向图,$M(D)$的交集数,而这样做,我们也解决了交集数时,$D$有循环。此外,还引入了一种新的变换--$D$与其剖分有向图的并,并计算了它的相交数。对于全有向图,我们扩展了前面的参数,让我们解决了交叉数的$T(D)$与$D$可能有循环,但在限制循环的有向图只接触(或从)自己,汇,和源。

英文摘要:

For any simple digraph $D$ we offer a new proof for the intersection number of its middle digraph, $M(D)$; while doing so we also solve for the intersection number when $D$ has loops. In addition, a new transformation, the union of $D$ and its subdivision digraph, is introduced and its intersection number calculated in full generality. For the total digraph, we extend previous arguments letting us solve for the intersection number of $T(D)$ with $D$ possibly having loops, but under the restriction loops of the digraph only touch (are to or from) themselves, sinks, and sources.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑