吉林大学学报（理学版）Issue(5)：893-896,4.DOI:10.13413/j.cnki.jdxblxb.2015.05.12
2类与4-圈有关图的优美性
Gracefulness of Two Types of Graphs Related to Cycles of Length Four
摘要
Abstract
The graph marked F n,4 that is formed by n pieces of 4-cycles with one common vertice in order.Let ui1 and ui2 be two vertices in graph F n,4 ,which connect ui1 and ui2 with m paths of length 2 for ui1 v ij u i2 (i ,j =1,2,…,n).The resulting graphs are denoted as m-F n,4 .Let G represent the graph obtained by connecting every vertex of graph m-F n,4 isolated vertex w to an edge of it.Let m-F n,4 +E n(m+1) be the graph obtained from G by attaching n(m+1)pendent edges to the vertex w of graph G. The constructor method gives graceful labeling of m - F n,4 and m - F n,4 + E n(m+1),thus proving graceful graphs m-F n,4 and m -F n,4 +E n(m+1).Thus,a series of graceful graphs can be constructed from one graceful graph.关键词
4-圈/优美图/优美标号Key words
4-cycles/graceful graph/graceful labeling分类
数理科学引用本文复制引用
唐保祥,任韩..2类与4-圈有关图的优美性[J].吉林大学学报（理学版）,2015,(5):893-896,4.基金项目
国家自然科学基金(批准号:11171114) （批准号:11171114）
