检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:唐保祥[1] 任韩 TANG Baoxiang;REN Han(School of Mathematics and Statistics,Tianshui Normal University,Tianshui 741001,Gansu Province,China;School of Mathematical Sciences,East China Normal University,Shanghai 200062,China)
机构地区:[1]天水师范学院数学与统计学院,甘肃天水741001 [2]华东师范大学数学科学学院,上海200062
出 处:《吉林大学学报(理学版)》2023年第1期79-84,共6页Journal of Jilin University:Science Edition
基 金:国家自然科学基金(批准号:11171114)。
摘 要:用构造方法给出图K_(2,n)-1-3-K_(3),K_(2,n)-2-2-K_(3),K_(2,n)-1-2-K_(3),K_(2,n)-2-K_(3)和K_(2,n)-3-P_(3)的优美标号,并证明这五类图都是优美图.当n≤5时,K_(2,n)-1-3-K_(3),K_(2,n)-2-2-K_(3),K_(2,n)-1-2-K_(3)和K_(2,n)-3-P_(3)都是极小优美图,并给出对应长度尺子刻度数最少的15组刻度值.The graceful labels of graphs K_(2,n)-1-3-K_(3),K_(2,n)-2-2-K_(3),K_(2,n)-1-2-K_(3),K_(2,n)-2-K_(3) and K_(2,n)-3-P_(3)were given by the construction method,and it was proved that these five kinds of graphs were all graceful graphs.When n≤5,K_(2,n)-1-3-K_(3),K_(2,n)-2-2-K_(3),K_(2,n)-1-2-K_(3) and K_(2,n)-3-P_(3) 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.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.188.39.45