排序方式： 共有2条查询结果，搜索用时 0 毫秒
1
1.
In 1983 J. A. Bondy mentioned a result of L.Lovsz. He said that it seems"magic". Now we give a simple proof of this result by using the basic probability theory only, and we may see why this result holds clearly. Let G be a graph with a specified vertex r.A path P=v_1v_2…v_k is rooted at r if v_1=r.For 1≤j≤k, the number of edges of G which are incident with v_j but with no v_i, i相似文献
2.
1