排序方式: 共有5条查询结果,搜索用时 78 毫秒
1
1.
2.
3.
For a graph G,let D denote an orientation of G having minimum diameter. Define f(G)=diamD.In this paper,we concentrate on exploring the minimum diameter of K_m∨(m≥1,n≥1).Some special cases are known:f(K_m∨)=∞,2,3, where m=1 and n≥1,m=2 or m≥4 and n=1,m=3 and n=1,respectively. So we only consider the case when m≥2 and n≥2.The following results are obtained. (1) f(K_m∨)=3,where m=2,3,n≥2 and m=n=4.(2) f(K_m∨)=2, where m≥5 and m is odd,2≤n≤■-m.(3) f(K_m∨)=2,where m≥4 and m≡0(mod4),2≤n≤■-(m/2 1).(4) f(K_m∨)=2,where m≥6 and m≡2(mod4),2≤n≤■-m/2.(5) f(K_m∨)=3,where m≥4,n>■. 相似文献
4.
5.
1