1) m-Regular Graph
m-正则图
2) (k,m)-regular graph
(k,m)-正则图
3) m-regular
m-正则
4) regular m-furcating tree
正则m叉树
1.
For a regular m-furcating tree, the authors derive a recurrence formula of the number of its S(n)= {Ki: 1<i<n}-factor through analysing the relation among i,t and m of sub-furcating trees.
在正则m叉树T中,删除K2及端点关联边,通过所得子正则m叉树中分枝点、叶数和m之间内在联系,本文导出正则m叉树T的S~(m)={Ki:1≤i≤n}-因子数递归公式。
5) M regular rings
左M-正则环
6) Regular M-crossing Tree
正则m-叉树
1.
We survey the reduction formula of characteristic polynomial of Regular M-crossing Tree and obtain which Regular M-crossing Tree become the Integral Graph condition.
本文主要是研究正则m-叉树特征多项式的递推公式,并通过其递推公式来得出正则m-叉树成为整图的条件。
补充资料：凡事豫则立，不豫则废
1.谓做任何事情，事先谋虑准备就会成功，否则就要失败。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条