单圈图的邻点可约全标号
Adjacent vertex reducible total labeling of unicyclic graphs
王丽 1李敬文 1杨文珠 1裴华艳1
作者信息
- 1. 兰州交通大学电子与信息工程学院,甘肃兰州 730070
- 折叠
摘要
针对单圈型运输网络在特殊情景下的标号问题,借鉴智能算法思路,设计一种新的启发式搜索算法,可判别有限点内所有单圈图是否存在邻点可约全标号.通过对单圈图图集进行实验分析,找到几类单圈图的标号特性,得到若干定理,并给出猜想:所有的单圈图均为AVRTL图.
Abstract
A new heuristic search algorithm is designed for the labeling problem of unicyclic transport networks in special scenarios,drawing on the ideas of intelligent algorithms,which can discriminate whether there is an adjacent vertex reducible total labeling for all unicyclic graphs within a finite number of vertices.Through experimental analysis of the set of unicyclic graphs,the labeling properties of several types of unicyclic graphs are found,several theorems are obtained,and a conjecture is given:All unicyclic graphs are AVRTL graphs.
关键词
单圈图/邻点可约全标号/标号算法/联图Key words
unicyclic graph/adjacent vertex reducible total labeling/labeling algorithm/joint graph引用本文复制引用
基金项目
国家自然科学基金资助项目(11961041)
国家自然科学基金资助项目(62262038)
甘肃省媒体融合技术与传播重点实验室资助项目(21ZD8RA008)
出版年
2024
NETL
NSTL
万方数据