齿轮图的全边友好指标集  

Full-edge friendly index sets of gear graph

作　　者：辛凤梅 王慧 高振滨 XIN Fengmei;WANG Hui;GAO Zhenbin(College of Modern Manufacturing Engineering,Heilongjiang University of Technology,Jixi 158100,China;Collene of Mathematical Sciencen,Harbin Ennineerinn University,Harbin 100021,Chinn)

机构地区：[1]黑龙江工业学院现代制造工程学院,鸡西108100 [2]哈尔滨工程大学数学科学学院,哈尔滨100001

出　　处：《黑龙江大学自然科学学报》2020年第5期513-518,共6页Journal of Natural Science of Heilongjiang University

基　　金：黑龙江省青年专项课题(GJD1319023).

摘　　要：对于简单图形G、边和顶点集用符号E(G)、V(G)进行描述,点标号函数f:V(G)→{0,1}通过诱导可得出关于边的标号函数f^+:E(G)→{0,1},证明可得f^+(uv)=f(u)+f(v),■uv∈E(G)成立。若■成立,则称标号函数f为G的友好标号,图G是友好图。本文研究齿轮图的全边友好标号问题,利用图结构的分解和点标号互换的方法给出齿轮图的全边友好指标集。For a simple graph G,the set of edges and vertices is described by symbols E(G)and V(G),the labeling function f:V(G)→{0,1}can be induced to obtain the labeling function f^+:E(G)→{0,1}of the edge,and f^+(uv)=f(u)+f(v)is proved to be true,for ■ uv∈E(G).A vertex labeling f of a graph G is said to be friendly if■.The problem of all edge friendly labeling of gear graph is studied.By using the decomposition of graph structure and the exchange of point labels,the index set of all edge friendly labeling is given.

关 键 词：全边友好指标集 边友好指标集 齿轮图 

分 类 号：O150[理学—数学]