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.
unicyclic graphadjacent vertex reducible total labelinglabeling algorithmjoint graph
NETL
NSTL
万方数据
