摘要
本文证明了在齿轮图W_n的每个齿凹处分别加任意的m_1,m_2,…,m.条边,只要满足条件max{m_1,m_2,…,m_n}≥n-2,则所得图为K-优美,并且给出了一些单圈图的K-优美结论,其中K为任意非负整数.
In this paper, we define umbrella graph: add any edges m_1, m_2,…,m_n in every gear concave of gear graph.If max{m_1,m_2,…,m_n}≥n-2,we prove that umbrella graph is K-gracefulness, and also give some conclusions about K-gracefulness of unicyclic graphs.
基金
黑龙江省自然科学基金
关键词
K-优美
齿轮图
伞图
K-gracefulness
gear graph
umbrella graph
