首页 | 本学科首页   官方微博 | 高级检索  
     

5类图的优美性
引用本文:唐保祥,任韩. 5类图的优美性[J]. 吉林大学学报(理学版), 2023, 61(1): 79-84
作者姓名:唐保祥  任韩
作者单位:1. 天水师范学院 数学与统计学院, 甘肃 天水 741001; 2. 华东师范大学 数学科学学院, 上海 200062
基金项目:国家自然科学基金(批准号:11171114);
摘    要:用构造方法给出图K2,n-1-3-K3,K2,n-2-2-K3,K2,n-1-2-K3,K2,n-2-K3和K2,n-3-P3的优美标号,并证明这五类图都是优美图.当n≤5时,K2,n-1-3-K3,K2,n-2-2-K3,K2,n-1-2-K3和K2,n-3-P3都是极小优美图,并给出对应长度尺子刻度数最少的15组刻度值.

关 键 词:优美图  优美标号  完全二部图  极小优美图  省刻度尺
收稿时间:2022-03-19

Gracefulness of Five Kinds of Graphs
TANG Baoxiang,REN Han. Gracefulness of Five Kinds of Graphs[J]. Journal of Jilin University: Sci Ed, 2023, 61(1): 79-84
Authors:TANG Baoxiang  REN Han
Affiliation:1. School of Mathematics and Statistics, Tianshui Normal University, Tianshui 741001, Gansu Province, China;
2. School of Mathematical Sciences, East China Normal University, Shanghai 200062, China
Abstract:The graceful labels of graphs were given by the construction method, and it was proved that these five kinds of graphs were all graceful graphs. When n≤5, were all extremely minimal graceful graph, from which the 15 groups of scale values with the least number of scales for the corresponding length ruler were given.
Keywords:graceful graph   graceful labeling   complete bipartite graph   minimal graceful graph   saving scale  
点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息
点击此处可从《吉林大学学报(理学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号