The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph.
本文考虑了图的中间图的邻点可区别全色数，并确定了路、圈、星图和扇图的中间图的邻点可区别全色数。
In this paper, we investigate star color criticality of graphs and its relationship with color criticality by providing two types of planar graphs which are star color critical but not color critical.
本文对图的星临界性及其与图的临界性之间的关系进行研究，给出了两类星临界但非临界的平面图。
More importantly, we shew that the two models enabled us to design new networks --- double star network and triangle network based on vector graphs.
更重要的是该模型能够使我们设计出了新的互连网络---双星网络和三角形网络。
应用推荐