In this paper, we show Brandt’s conjecture is true for triangle-free graphs, that every non-bipartite triangle-free graph of order n and sizeat least n2/4-n+ 5 is weakly pancyclic.
在本文中，我们证明对无三角形的图，Brandt的猜想成立，即每个边数至少为n2/4-n+5的n阶无三角形的非二部图是弱泛圈图。
参考来源 - 无三角形的弱泛圈图·2,447,543篇论文数据，部分数据来源于NoteExpress
研究了2连通无三角形图中长圈的存在性。
In this paper, the existence of large cycles in 2-connected triangle-free graphs is discussed.
本文首次提出电机饱和磁场的无内节点亚参三角形有限元计算问题，并给出了构造其形状函数的有效方法。
First the paper addresses the problem that subparametric triangular finite elements without inner points are used to calculate the saturated magnetic fields in electric machines.
推导出由特征多项式的系数表示的线图（无重边图）中圈的个数，双向结点对个数，单向结点对个数及简单图中有向三角形个数的计算公式，等等。
The formulae for the number of loops, edges, triangles, pairs of two-way nodes and pairs of one-way nodes are deduced by the coefficients of a characteristic polynomial, so on.
应用推荐