中山大学学报（自然科学版）2012，Vol.51Issue(5)：63-66,4.
两类非连通图(P2∨(Kn))(0,0,r1,0,…,0,rn)∪St( m)及(P2∨(Kn))(r1+a,r2,0,…,0)∪Gr的优美性
The Gracefulness of Two Kinds of Unconnected Graphs (P2∨(Kn))(0,0,r1,0,…,0,rn)∪St(m) and (P2∨(Kn))(r1 + a,r2,0,…,0)∪Gr
摘要
Abstract
For natural numbers n, m and i∈ N, let Ki be an i-vertex complete graph, let Ka be the complement graph of graph Kn, A (m + 1) -vertex star tree is represented by St(m). Let Gr be a graceful graph with r-edges, let Pn be a n-vertex path and let P2 V Kn be the join graph of P2 and Kn. Two kinds of unconnected graphs (P2 ∨(Kn))(r1,r2,0,…,0)∪St(m) and (P2∨(Kn))(r1 +a,r2,0,…,0)∪Gr, are presented. It proves that the above two kinds of graphs are graceful graphs when n ≥ 2.关键词
联图/非连通图/冠/星/优美图Key words
join graph/ disconnected graph/ corona/ star/ graceful graph分类
数理科学引用本文复制引用
吴跃生,徐保根..两类非连通图(P2∨(Kn))(0,0,r1,0,…,0,rn)∪St( m)及(P2∨(Kn))(r1+a,r2,0,…,0)∪Gr的优美性[J].中山大学学报（自然科学版）,2012,51(5):63-66,4.基金项目
国家自然科学基金资助项目(11061014) （11061014）
江西省自然科学基金资助项目(20114BAB201010) （20114BAB201010）
华东交通大学校立科研基金资助项目(11JC05) （11JC05）
