数学季刊 >

2021 , Vol. 36 >Issue 3: 221 - 234

DOI: https://doi.org/10.13371/j.cnki.chin.q.j.m.2021.03.001

一类三正则图的全友好指数集

展开
  •  School of Mathematics and Information Science, Henan Polytechnic University
BAI Yu-jie (1995-), famale, native of Zhangjiakou, Hebei, postgraduate student of Henan Polytechnic University, engages in graph theory; WU Shu-fei (1989-), male, native of Jiaozuo, Henan, lecture of Henan Polytechnic University, Ph.D, engages in graph theory.

收稿日期: 2021-05-21

  网络出版日期: 2021-10-08

基金资助

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

收起

Full Friendly Index Sets of a Family of Cubic Graphs

Expand
  •  School of Mathematics and Information Science, Henan Polytechnic University
BAI Yu-jie (1995-), famale, native of Zhangjiakou, Hebei, postgraduate student of Henan Polytechnic University, engages in graph theory; WU Shu-fei (1989-), male, native of Jiaozuo, Henan, lecture of Henan Polytechnic University, Ph.D, engages in graph theory.

Received date: 2021-05-21

  Online published: 2021-10-08

Supported by

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

Fold

摘要

 Let G =( V,E ) be a graph. For a vertex labeling f : V →Z 2 , it induces an edge labeling f + : E→Z 2 , where for each edge v 1 v 2 ∈E we have f + ( v 1 v 2 )= f ( v 1 )+ f ( v 2 ). For each i∈Z 2 , we use v f ( i ) (respectively, e f ( 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 one. The full friendly index set of a graph G , denoted by FFI ( G ), consists of all possible values of e f (1) −e f (0), where f ranges over all friendly labelings of G . In this paper, motivated by a problem raised by [6], we study the full friendly index sets of a family of cubic graphs.

关键词： Vertex labeling; Friendly labeling; Embedding labeling graph method; Cubicgraph

本文引用格式

白雨杰, 毋述斐 . 一类三正则图的全友好指数集[J]. 数学季刊, 2021 , 36(3) : 221 -234 . DOI: 10.13371/j.cnki.chin.q.j.m.2021.03.001

Abstract

Let G =( V,E ) be a graph. For a vertex labeling f : V →Z 2 , it induces an edge labeling f + : E→Z 2 , where for each edge v 1 v 2 ∈E we have f + ( v 1 v 2 )= f ( v 1 )+ f ( v 2 ). For each i∈Z 2 , we use v f ( i ) (respectively, e f ( 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 one. The full friendly index set of a graph G , denoted by FFI ( G ), consists of all possible values of e f (1) −e f (0), where f ranges over all friendly labelings of G . In this paper, motivated by a problem raised by [6], we study the full friendly index sets of a family of cubic graphs.

Key words： Vertex labeling; Friendly labeling; Embedding labeling graph method; Cubic graph

Options
文章导航

/

〈 〉

版权所有 © 《数学季刊》编辑部
地址：河南省开封市明伦街85号河南大学数学季刊编辑部
电话：0371-23881698　E-mail: sxjk@henu.edu.cn　QQ: 2454327236
本系统由北京玛格泰克科技发展有限公司设计开发　技术支持：support@magtech.com.cn