摘要
本文探讨了数学图论中的Johnson图,首先证明了Johnson图是哈密尔顿连通图。最后我们通过对Johnson图的顶点V(J(n,k))和E(J(n,k))不同方式的计算得到一些组合等式。
In this paper, we discuss Johnson graph graph is Hamiltonian-connected graph. Finally, we in mathematical graph theory and give some combinatorial formulas counting |V(J(n,k))| and |E(J(n,k))| in Johnson graph. prove that Johnson by different ways of
出处
《重庆航天职业技术学院学报》
2014年第1期64-66,71,共4页
Journal of Chongqing Aerospace Polytechnic