Title

双圈图边幻和全标号.

Authors

邵淑宏; 李敬文; 顾彦波; 王笔美

Abstract

The edge-magic total labelling of a graph G (p, q) means that the sum of labellings of any edge and its incident vertice is equal to a constant, and the mapping of all labelling values of vertice and edges is the set { 1, 2, ···, p q } . In this paper, a judge algorithm is designed to get all edge-magic total labelling of bicyclic graphs within 15 vertices. Through the analysis of the results, finding the rules of edge-magic total labelling for two kinds of bi cyclic graphs, and defining the new graph operational symbols CnΔClΔSm and CnΔClΔSm to describe such graphs, several theorems are summarized and proved finally. It is further conjectured that the relevant conclusions are still valid when the vertex p ≥ 16.

Subjects

GRAPH labelings; ALGORITHMS; LABELS; EDGES (Geometry)

Publication

Journal of Central China Normal University, 2020, Vol 54, Issue 6, p918

ISSN

1000-1190

Publication type

Academic Journal

DOI

10.19603/j.cnki.1000-1190.2020.06.002