Full Friendly Index Sets of a Family of Cubic Graphs

作     者：BAI Yu-jie WU Shu-fei BAI Yu-jie;WU Shu-fei

作者机构：School of Mathematics and Information ScienceHenan Polytechnic UniversityJiaozuo 454003China 

出 版 物：《Chinese Quarterly Journal of Mathematics》 (数学季刊（英文版）)

年 卷 期：2021年第36卷第3期

页      面：221-234页

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China(Grant No.11801149) Doctoral Fund of Henan Polytechnic University(Grant No.B2018-55) 

主　　题：Vertex labeling Friendly labeling Embedding labeling graph method Cubic graph 

摘      要：Let G=(V,E)be a *** a vertex labeling f:V→Z2,it induces an edge labeling f+:E→Z2,where for each edge v1 v2∈E we have f+(v1 v2)=f(v1)+f(v2).For each i∈Z2,we use vf(i)(respectively,ef(i))to denote the number of vertices(respectively,edges)with label i.A vertex labeling f of G is said to be friendly if vertices with different labels differ in size by at most *** full friendly index set of a graph G,denoted by F F I(G),consists of all possible values of ef(1)-ef(0),where f ranges over all friendly labelings of *** this paper,motivated by a problem raised by[6],we study the full friendly index sets of a family of cubic graphs.