-
Adjacent vertex reducible total labeling of some joint graphs
- WANG Jiang, LI Jingwen, GAO Xin, SUN Liangjing
-
JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(8):
57-67.
doi:10.6040/j.issn.1671-9352.0.2023.465
-
Abstract
(
42 )
PDF (4571KB)
(
13
)
Save
-
References |
Related Articles |
Metrics
For an undirected connected graph G(V,E), if there exists a single mapping f:V(G)∪E(G)→{1,2,…,|V|+|E|}, and conditions uv∈E(G) and d(u)=d(v) are satisfied, then there exists S(u)=S(v), where S(u)=f(u)+∑ holds. Let d(u) denote the degree of vertex u; thus, f is referred to as an adjacent vertex reducible total labeling(AVRTL)of G. This study combines genetic algorithms and particle swarm algorithms to design a heuristic search algorithm that can determine whether a random graph with a finite number of vertices contains an AVRTL. Through the analysis of experimental results, several theorems regarding linked graphs are summarized and proved. Finally, the following conclusion is drawn: if subgraphs G1 and G2 are AVRTL graphs, then the graph operation ↑ab exhibits closure, meaning the linked graph G1↑abG2 is also an AVRTL graph.