In this paper, spanning subgraphs and its countingtheorem are given.
给出了生成子图和生成子图的计数定理。
2
Level diagram example shows the practicality and effectiveness of the construction theorem and countingtheorem, which is a simple and easy method to construct a complete graph of the spanning tree.
平图例子验证了构造定理和计数定理的实用性和有效性,是构造一个完全图的生成树的简单易行的方法。
3
By the second main theorem for non-constant holomorphic curves with moving targets without counting multiplicity, the uniqueness problem of holomorphic curves is discussed.