Full friendly index sets of mCn  

作　　者：Yurong JI Jinmeng LIU Yujie BAI Shufei WU 

机构地区：[1]School of Mathematics and Information Science,Henan Polytechnic University,Jiaozuo 454003,China [2]Basic Department,Henan College of Industry and Information Technology,Jiaozuo 454003,China

出　　处：《Frontiers of Computer Science》2022年第3期95-99,共5页中国计算机科学前沿（英文版）

基　　金：This work was supported partly by the National Natural Science Foundation of China(Grant Nos.11801149,11801148);S.Wu was also partially supported by the Doctoral Fund of Henan Polytechnic University(B2018-55).

摘　　要：Let G be a connected simple graph with vertex set V(G)and edge set E(G).A binary vertex labeling f:V(G)→Z2,is said to be friendly if the number of vertices with different labels differs by at most one.Each vertex friendly labeling/induces an edge labeling f*E(G)→Z2,defined by f*(xy)=f(x)+f(y)for each xy∈E(G).Let er(i)=\{e∈E(G):f*(e)=i}|.The full friendly index set of G,denoted by FFI(G),is the set{ef*(1)-ep(0):f is friendly}.In this paper,we determine the full friendly index set of a family of cycle union graphs which are edge subdivisions of P2×Pn.

关 键 词：vertex labeling friendly labeling full friendly index set PARTITION BISECTION 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]