关于图的一些标号的分析-应用数学专业论文.docxVIP

HYPERLINK \l _TOC_250006 3.3 Reseaching Results on Odd-graceful Graphs 32 HYPERLINK \l _TOC_250005 Chapter 4 Felicitous Labellings of Graphs 47 HYPERLINK \l _TOC_250004 Felicitous Labellings of Graphs 47 De?nition of Felicitous Labellings 48 HYPERLINK \l _TOC_250003 Some Felicitous Graphs 49 HYPERLINK \l _TOC_250002 References 65 HYPERLINK \l _TOC_250001 Published and Submitted Papers During Graduate Study Period 71 HYPERLINK \l _TOC_250000 Acknowledgements 73 致 谢 75 Abstract In 1966, in order to settle Ringel’s conjecture, Rosa introduces the concept of graph labellings: A graph labelling is a mapping from the vertex set of a graph to a set of integers. By various constraints we have many types of graph labellings. Clearly, graph labelling is an important branch of graph theory since it can be applied to a wide of scienti?c areas. However, there are many new problems yielding in attacking famous conjectures, such as Graceful Tree Conjecture, Strongly Graceful Tree Conjecture, Odd-graceful Tree Conjecture, Felicitous Tree Conjecture and so on. Based on the known conclusions and results on graph labellings, my researching mainly focus on the following aspects: Chapter One distributes a simple introduction to the development of graph theory and graph labellings. Basic terminology and notation of graph theory are de?ned, and the de?nitions, conjectures and some results of graph labellings are given. Chapter Two works mainly on graceful labelling of graphs. We list some results in current researching graceful labelling of graphs, and try to show a summary of studying graceful labelling of graphs. We investigate particular graceful labellings in order to ?nd some regularities of graceful labellings that can be used to construct large scale of graceful graphs, and do the operation of moving edge principle for attacking Graceful Tree Conjecture. In Chapter Three, we, ?rst of all, introduce the study on odd-graceful labelings of graphs. Based on the study of