新疆大学学报（自然科学版）
新疆大學學報（自然科學版）
신강대학학보（자연과학판）
XINJIANG UNIVERSITY JOURNAL(NATURAL SCIENCE EDITION)
2007年
2期
159-165
,共7页
阿依古丽·马木提%艾尔肯·吾买尔%边红
阿依古麗·馬木提%艾爾肯·吾買爾%邊紅
아의고려·마목제%애이긍·오매이%변홍
离散度%坚韧度%图的乘积
離散度%堅韌度%圖的乘積
리산도%견인도%도적승적
Scattering number%toughness%product
连通图的离散度是用s(G)来表示的,s(G)=max{ω(G-S)-|S|:ω(G-S)＞1,S (∩) V(G)}.给出了两个完全图乘积的和一个完全图与路的乘积的离散度.还给出了两个完全图乘积的坚韧度.
連通圖的離散度是用s(G)來錶示的,s(G)=max{ω(G-S)-|S|:ω(G-S)＞1,S (∩) V(G)}.給齣瞭兩箇完全圖乘積的和一箇完全圖與路的乘積的離散度.還給齣瞭兩箇完全圖乘積的堅韌度.
련통도적리산도시용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 (∩) 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.
