一些特殊图类乘积的离散度(英文)

Scattering Number of the Product of Some Special Classes of Graphs

连通图的离散度是用s(G)来表示的,s(G)=max{ω(G-S)-|S|:ω(G-S)>1,SV(G)}.给出了两个完全图乘积的和一个完全图与路的乘积的离散度.还给出了两个完全图乘积的坚韧度.

The scattering number s（G） of a noncomplete connected graph G is defined by s（G） = max ω（G - S） - ｜S｜ ω（G - S） 〉 1, S belont V（G）} . In this paper, we determine the scattering number of the product of two complete graphs and the product of a path and a complete graph. Moreover, we determine the toughness of the product of two complete graphs.