安徽大学学报（自然科学版）2016，Vol.40Issue(4)：12-16,5.DOI:10.3969/j.issn.1000-2162.2016.04.003
几类和扇有关图的优美性
Gracefulness of some graphs related to Fan
摘要
Abstract
This paper contained the following results :for any natural number n≥2 ,the graph K1 ∨ Pn ∪ Pn+1 was (n-1)‐strong graceful ;for any natural number n≥3 ,the graph K 1 ∨ P(1 )n ∪ P(2 )n∪ G was graceful ; for any natural number n ≥ 4 , the graph K1 ∨ P(1)n ∪ P(2)n ∪ P(3)n ∪ H was graceful ,where k= n2 ,Pn be a path with n vertices , and Gi be a graceful graph with i edges .Given a graceful graph Gn-1 with its graceful labeling f ,and Gk-1 with its graceful labeling g ,we assumed that a vertex u∈ Gn-1 ,v∈ Gk-1 with f(u)= g(v)=0 .Taking two copies of P2 ,xy and x′y′,identifying vertices x and u ,x′and v ,we obtained the resulting graph G and H respectively .关键词
图/优美图/k-强优美图Key words
graph/graceful graph/k-strong graceful graph分类
数理科学引用本文复制引用
王涛,魏静,李德明..几类和扇有关图的优美性[J].安徽大学学报（自然科学版）,2016,40(4):12-16,5.基金项目
国家自然科学基金资助项目（10201022，11101020）；北京市自然科学基金资助项目（1102015）；中央高校基本科研业务费资助项目（2011B019，JCB1207B ，3142014037）；华北科技学院重点学科资助项目 （）
