典型文献
Full friendly index sets of mCn
文献摘要：
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 f induces an edge labeling f*∶ E(G)→ Z2,defined by f*(xy)=f(x)+f(y)for each xy ∈ E(G).Let ef*(i)=|{e ∈ E(G)∶ f*(e)=i}|.The full friendly index set of G,denoted by FFI(G),is the set{ef*(1)-ef*(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.
文献关键词：
中图分类号：
作者姓名：
Yurong JI;Jinmeng LIU;Yujie BAI;Shufei WU
作者机构：
School of Mathematics and Information Science,Henan Polytechnic University,Jiaozuo 454003,China;Basic Department,Henan College of Industry and Information Technology,Jiaozuo 454003,China
文献出处：
引用格式：
[1]Yurong JI;Jinmeng LIU;Yujie BAI;Shufei WU-.Full friendly index sets of mCn)[J].计算机科学前沿,2022(03):92-96
A类：
mCn
B类：
Full,friendly,sets,Let,connected,simple,vertex,edge,binary,labeling,Z2,said,number,vertices,different,labels,differs,by,at,most,one,Each,induces,defined,xy,+f,each,full,denoted,FFI,In,this,paper,we,determine,family,cycle,union,graphs,which,are,subdivisions,P2,Pn
AB值：
0.520527
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
