Backbone coloring of graphs with Hamilton path backbones
In order to solve the channel assignment problem in network information transmission system,more restrictions are given to the more important substructures(called backbone)when designing a network,and less restrictions are given to the other parts of the network,and this type of problem can be abstracted as the backbone coloring of graphs,which is an important variant of the classical coloring theory.Using square of cycle and generalized Peterson graph to describe two special types of network information transmission systems,and considering the Hamiltonian path as the backbone of the graph,the λ-backbone coloring of the square of cycle and the generalized Petersen graph is investigated,and BBCλ(G,P)=λ+2 is obtained.
backbone coloringHamiltonian pathsquare of cyclesgeneralized Petersen graphsnonplanar graph
万方数据
维普
