基于粘合的思想研究整和图  

Research on integral sum graph based on identification

作　　者：石端银[1] 张秋杰[1] 李文宇[1] 

机构地区：[1]黑龙江科技学院理学院,哈尔滨150027

出　　处：《黑龙江科技学院学报》2012年第6期645-647,共3页Journal of Heilongjiang Institute of Science and Technology

基　　金：黑龙江省教育厅科学技术研究项目(12523046)

摘　　要：为了以数据的形式来存储图,引入了整和图标号理论。采用顺序标号法提供了联图和花树的一种整和标号,从而进一步利用粘合的思想方法证明了有公共顶点的一系列多重联图和多重花树仍然是整和图。该研究推广了整和图类型,进一步完善了整和图理论。This paper introduces the theory of integral sum graph labeling in order to store the graph in the form of data.The paper provides the integral sum labeling of joined graphs and flower trees adopting order labeling method and proves that all multiple joined graphs and all multiple flower trees with the same vertex remain integral sum graphs using the idea of identification.This study fascitates a wider use of the type of integral sum graph and an improvement in the integral sum graph theory.

关 键 词：整和图 粘合 花树 联图 

分 类 号：O157.5[理学—数学]