1) (k,d)-graceful graph
(k,d)-优美图
2) k-graceful graph
k优美图
1.
In [3],Lu xian proved that graph St(m)∪Kp,q is a k-graceful graph when k>1 and min{p,q}≥2.
路线等在[3]中证明了当k>1,且min{p,q}≥2时,图St(m)∪Kp,q是k优美图。
3) k graceful graph
k-优美图
4) (n,k,d)-graphs
(n,k,d)-图
1.
Liu and Yu~([1]) first introduced(n,k,d)-graphs,and gave some properties and characterization of(n,k,d)-graphs.
如果删去G中任意n个点后所得的图有k-匹配,并且任一k-匹配都可以扩充为一个亏d-匹配,那么称G是一个(n,k,d)-图。
5) optimal k-d tree
优化k-d树
6) k-graceful
K-优美
1.
In this paper,we defined "m-foot"chain graphs, and discussed their gracefulness,obtaining the results that six kinds of "m-foot"chain graphs are k-graceful bigraphs,and we also gave their graceful labelings.
定义了"m-脚"链图(即在P2×Pn的m个顶点各粘接一条悬挂边),讨论了它的优美性,得到了6种情形下的"m-脚"链图是k-优美的二分图,并给出了相应的优美标号。
补充资料：优美
①美好；美妙：姿态优美｜风景优美。②亦称“秀美”。美学范畴之一。与“崇高”相对。指事物呈现出婉约柔和、纤巧雅致的特性，以此唤起人们亲切、愉悦、平和、自由的审美感受。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条